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

ruvnet/metaharness

Measured 17 November 2026, 04:05 UTC, at code version 1dc8f00

First survey, so nothing to compare with yet Code coverage: not measured

Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).

CAI score 50.3out of 100 Adequate
CriticalWeakAdequateStrongExemplary

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

A large codebase: 145,523 lines of product code in 58 projects, tests not counted · Estimated rebuild effort: about 1.3 person-years · Weakest lens: Accessibility, 37.3

Findings by how serious they are

43 critical 979 serious 152 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 04:05 UTC

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

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

88of 88 dimensions measured by tools.
1154of 1174 findings point to an exact file and line, so you can open each one in the code. The other 20 concern the repository as a whole, such as missing documentation.
88dimensions across 8 lenses, read from 145,523 lines of product code in 58 projects.
Chapters

Executive summary

ruvnet/metaharness falls short of our standard for a preview release, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 50.3 out of 100 and is rated Adequate, and 31 of its 43 critical findings are security problems.

Accessibility, at 37.3, is the weakest lens and counts most in the score. The best first step for the work it takes is replacing the five exposed passwords or keys and switching the old ones off, worth about 4.7 points. Adding text alternatives would lift Accessibility itself, worth about 6.8 points. Raising Accessibility to 65 would lift the score to about 59.9.

Nine weaknesses in the code could be used by an attacker. Six places in the code run text as code, which an attacker could use, and five passwords or keys are open to anyone who can read the repository. Fixing the weaknesses the scanner points to, replacing text run as code with direct calls and replacing each exposed password or key would close these risks. Limiting each secret to its own step would fix the three secrets exposed to more of the pipeline than needed, and the three pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions. The three loops of files that import each other need breaking.

The product code is 145,523 lines, about €190,000 to rebuild.

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

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

If Accessibility rose from 37.3 to 65, the lowest score rated Strong, the score would rise from 50.3 to about 59.9.

Code composition: what the lines of code are
Product code 71%Tests 29%
Rebuild cost: about €190,000 · Estimate
Cost to rebuild€64,000 to €320,000, for 1,066 to 3,382 hours of work, about 1.3 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 50. 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.
SizeLarge: 145,523 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 5 Leaked secret finding(s) in Secret Scanning — start with REDACTED (5).
Raises the score by about 4.7 points · Low effort · Secret Scanning
2
Resolve the 3 Flaky test finding(s) in Test Reliability.
Raises the score by about 4.4 points · Low effort · Test Reliability
3
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 6.8 points · Medium effort · Text alternatives

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €190,000 to build again, about 1.3 person-years of work. Its weakest lens is Accessibility, at 37.3 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Resolve the 5 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 4.7 points for low effort, because it clears the 5 Secret Scanning 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 6.4 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 93,908 lines over the last 90 days, which is about 380,849 lines a year. At that pace, the extra work comes to an estimated 38.8 to 232.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch @metaharness/arc-agi-3 arc-agi-3 @metaharness/harness harness @metaharness/arc-agi-3->@metaharness/harness @metaharness/kernel kernel @metaharness/arc-agi-3->@metaharness/kernel @metaharness/arc-agi-3-bench arc-agi-3-bench @metaharness/arc-agi-3-bench->@metaharness/arc-agi-3 @metaharness/arc-agi-3-chatgpt arc-agi-3-chatgpt @metaharness/arc-agi-3-chatgpt->@metaharness/arc-agi-3 @metaharness/arc-agi-3-chatgpt->@metaharness/kernel @metaharness/autogenous autogenous @metaharness/flywheel flywheel @metaharness/autogenous->@metaharness/flywheel @metaharness/avo avo @metaharness/horizon horizon @metaharness/avo->@metaharness/horizon @metaharness/darwin darwin @metaharness/evals-extract evals-extract @metaharness/evals-extract->@metaharness/flywheel @metaharness/evals-hle evals-hle @metaharness/evals-hle->@metaharness/flywheel @metaharness/evals-math evals-math @metaharness/evals-math->@metaharness/flywheel @metaharness/evals-servedmodel evals-servedmodel @metaharness/evals-servedmodel->@metaharness/flywheel @metaharness/evals-sql evals-sql @metaharness/evals-sql->@metaharness/flywheel @metaharness/evals-toolcall evals-toolcall @metaharness/evals-toolcall->@metaharness/flywheel @metaharness/host-claude-code host-claude-code @metaharness/host-claude-code->@metaharness/kernel @metaharness/host-codex host-codex @metaharness/host-codex->@metaharness/kernel metaharness metaharness metaharness->@metaharness/avo metaharness->@metaharness/darwin metaharness->@metaharness/flywheel metaharness->@metaharness/kernel ruflo-kernel ruflo-kernel __more__ +36 more projects

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.

531 modules, with 638 dependencies between them. 2 loops run through 4 of the modules, marked above the diagonal.

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 apps.web-ui.src.generator.types2 packages.arc-agi-3-chatgpt.src.types3 packages.arc-agi-3.src.types4 packages.avo.src.types5 packages.darwin-mode.src.security.types6 packages.evals-extract.src.data7 packages.flywheel.src.types8 packages.harness.src.types9 packages.jujutsu.src.types10 packages.kernel-js.src.types11 packages.redblue.src.types12 packages.sdk.src13 services.apicompletions.src.deps14 apps.web-ui.src.generator.repo15 packages.arc-agi-3.src.controller16 packages.avo.src.ports17 packages.darwin-mode.src.contrastive.types18 packages.evals-extract.src19 packages.evals-hle.src20 packages.evals-math.src21 packages.evals-servedmodel.src22 packages.evals-sql.src23 packages.evals-toolcall.src24 packages.flywheel.src25 packages.harness.src.router26 packages.projects.src27 services.apicompletions.src.types.openai28 packages.arc-agi-3.src.avo-types29 packages.avo.src30 packages.create-agent-harness.src.genome31 packages.darwin-mode.src.security32 packages.harness.src33 packages.harness.src.kernel34 packages.horizon.src.driver35 packages.arc-agi-3-bench.src.types36 packages.arc-agi-3-chatgpt.src37 packages.arc-agi-3.src38 packages.create-agent-harness.src39 packages.darwin-mode.src40 packages.arc-agi-3-bench.src
1 apps.web-ui.src.generator.types
2 packages.arc-agi-3-chatgpt.src.types
3 packages.arc-agi-3.src.types
4 packages.avo.src.types
5 packages.darwin-mode.src.security.types
6 packages.evals-extract.src.data
7 packages.flywheel.src.types
8 packages.harness.src.types
9 packages.jujutsu.src.types
10 packages.kernel-js.src.types
11 packages.redblue.src.types
12 packages.sdk.src
13 services.apicompletions.src.deps
14 apps.web-ui.src.generator.repo4
15 packages.arc-agi-3.src.controller25
16 packages.avo.src.ports16
17 packages.darwin-mode.src.contrastive.types3
18 packages.evals-extract.src231
19 packages.evals-hle.src131
20 packages.evals-math.src131
21 packages.evals-servedmodel.src13
22 packages.evals-sql.src131
23 packages.evals-toolcall.src131
24 packages.flywheel.src19
25 packages.harness.src.router1
26 packages.projects.src11
27 services.apicompletions.src.types.openai2
28 packages.arc-agi-3.src.avo-types131
29 packages.avo.src1321
30 packages.create-agent-harness.src.genome2
31 packages.darwin-mode.src.security111
32 packages.harness.src211
33 packages.harness.src.kernel432
34 packages.horizon.src.driver1
35 packages.arc-agi-3-bench.src.types62
36 packages.arc-agi-3-chatgpt.src12215
37 packages.arc-agi-3.src4528
38 packages.create-agent-harness.src81
39 packages.darwin-mode.src351
40 packages.arc-agi-3-bench.src118
Uses a module listed above itPart of a loopThe module itself
1 apps.web-ui.src.generator.types2 packages.arc-agi-3-chatgpt.src.types3 packages.arc-agi-3.src.types4 packages.avo.src.types5 packages.darwin-mode.src.security.types6 packages.evals-extract.src.data7 packages.flywheel.src.types8 packages.harness.src.types9 packages.jujutsu.src.types10 packages.kernel-js.src.types11 packages.redblue.src.types12 packages.sdk.src13 services.apicompletions.src.deps14 apps.web-ui.src.generator.repo15 packages.arc-agi-3.src.controller16 packages.avo.src.ports17 packages.darwin-mode.src.contrastive.types18 packages.evals-extract.src19 packages.evals-hle.src20 packages.evals-math.src21 packages.evals-servedmodel.src22 packages.evals-sql.src23 packages.evals-toolcall.src24 packages.flywheel.src25 packages.harness.src.router26 packages.projects.src27 services.apicompletions.src.types.openai28 packages.arc-agi-3.src.avo-types29 packages.avo.src30 packages.create-agent-harness.src.genome31 packages.darwin-mode.src.security32 packages.harness.src33 packages.harness.src.kernel34 packages.horizon.src.driver35 packages.arc-agi-3-bench.src.types36 packages.arc-agi-3-chatgpt.src37 packages.arc-agi-3.src38 packages.create-agent-harness.src39 packages.darwin-mode.src40 packages.arc-agi-3-bench.srcapps.web-ui.src.generator.types1packages.arc-agi-3-chatgpt.src.types2packages.arc-agi-3.src.types3packages.avo.src.types4packages.darwin-mode.src.security.types5packages.evals-extract.src.data6packages.flywheel.src.types7packages.harness.src.types8packages.jujutsu.src.types9packages.kernel-js.src.types10packages.redblue.src.types11packages.sdk.src12services.apicompletions.src.deps13apps.web-ui.src.generator.repo14packages.arc-agi-3.src.controller15packages.avo.src.ports16packages.darwin-mode.src.contrastive.types17packages.evals-extract.src18packages.evals-hle.src19packages.evals-math.src20packages.evals-servedmodel.src21packages.evals-sql.src22packages.evals-toolcall.src23packages.flywheel.src24packages.harness.src.router25packages.projects.src26services.apicompletions.src.types.openai27packages.arc-agi-3.src.avo-types28packages.avo.src29packages.create-agent-harness.src.genome30packages.darwin-mode.src.security31packages.harness.src32packages.harness.src.kernel33packages.horizon.src.driver34packages.arc-agi-3-bench.src.types35packages.arc-agi-3-chatgpt.src36packages.arc-agi-3.src37packages.create-agent-harness.src38packages.darwin-mode.src39packages.arc-agi-3-bench.src40425163231131131131311311911121311321211121143216212215452881351118+491 more modules (most-connected shown)

At a glance — Code Health · 63.2 · Adequate · gated by D1, D2 ·

At a glance — Architecture · 72.1 · Strong ·

At a glance — Maturity · 96.2 · Exemplary ·

At a glance — Readiness · 51.3 · Adequate · gated by D13, P7 ·

At a glance — Security · 71.1 · Adequate · gated by D29 ·

At a glance — Event Sourcing · 100.0 · Exemplary ·

At a glance — Accessibility · 37.3 · Weak · gated by AC1, AC4 ·

At a glance — Performance · 72.9 · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection56High / Critical
A07:2025 — Authentication Failures5High / Critical
A02:2025 — Security Misconfiguration5High / Critical
A03:2025 — Software Supply Chain Failures4Medium

Roadmap

Top priorities: Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video; Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href; Resolve the 5 Leaked secret finding(s) in Secret Scanning — start with REDACTED (5).

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

Do thisHelpsEffortDimension
Resolve the 5 Leaked secret finding(s) in Secret Scanning — start with REDACTED (5).+4.7 ptsLowSecret Scanning
Resolve the 3 Flaky test finding(s) in Test Reliability.+4.4 ptsLowTest Reliability
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+6.8 ptsMediumText alternatives
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+6.4 ptsMediumKeyboard semantics
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+2.9 ptsMediumVisual & motion safety
Bound every outbound call: pass `signal: AbortSignal.timeout(ms)` to `fetch`, set `timeout` on the axios instance (`axios.create({ timeout })`), and add retries with back-off (`axios-retry`, `p-retry`) and a breaker (`opossum`, `cockatiel`) around dependencies that fail.+1.9 ptsMediumOutbound HTTP resilience
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.+1.4 ptsMediumForms & labels
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+1.3 ptsMediumPage structure

File quality

Per-file score 0–10 — a quality signature. Of 239 files carrying findings, judged against the Preview bar: 1% slop · 7% mixed · 92% near-clean.

FileScoreBandWorst signal
REDACTED2.1SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.3MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.7MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.7MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.7MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedSecret Scanning: Leaked secret: REDACTED
REDACTED5.8MixedSecret Scanning: Leaked secret: REDACTED
REDACTED5.8MixedIaC & Container Security: High IaC: REDACTED
REDACTED6.2MixedIaC & Container Security: Medium IaC: REDACTED
REDACTED6.4MixedStatic Analysis (SAST): Medium: REDACTED
packages/create-agent-harness/src/score.ts6.7MixedCyclomatic Complexity: score.scoreCmd (cyclomatic 26)
REDACTED6.9MixedDependency Vulnerabilities: Medium CVE: REDACTED

How the grades work

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

Critical — 43

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 — 979

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 — 152

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

Could not be resolved — 10

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

Methodology & how to trust this report

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

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

What we checked — 88 dimensions across the health lenses
D1D2D3D4D5D6D7D10D11D13D14D15D17D19D20D21D22D23D24D25D26D27D28D29D30D31D34D35D36D37D43D44AC1AC2AC3AC4AC5AC6AX10AX3AX4AX6AX9ES1ES2GD1IC1M1M2M3M4P1P10P2P3P4P5P6P7PF1PF3R1R10R11R2R3R4R5R6R7R8R9X1X12X13X16X17X18X2X21X24X25X28X29X3X30X4X5

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e7ae-c782-725f-b58b-0dbeb198d96f.

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

Run transparency — what happened this run

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

  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 3,846 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 7 test source file(s) (.rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 14 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (8 contributor(s) across 1058 commit(s) sampled, automation and bot accounts excluded). One of them holds 97% of the history; the other 7 hold 0.4% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D23 Boundary Type-Coupling — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind measured 0/40 valid on a seeded held-out sample of its rows on 98 C# repositories (docs/plans/deterministic-engine/adjudication/P5c-D23-units.md, "Version 1 ON MAIN"): the noise rows were dependencies on layer folders, shared cores and grouping folders read as contexts. By the pre-registered fallback (PREREGISTRATION v37) it publishes no row until version 4 passes its gate. The candidates are counted here, not reported as findings, and the score does not include them.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D25 ADR Conformance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The code index reads C#, Razor, TypeScript, JavaScript and Vue. A rule whose scope holds production code in another language is not called honoured, because its uses could sit in that code.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `packages/arc-agi-3-chatgpt/src/official-avo-runtime.ts`, `packages/arc-agi-3-chatgpt/src/tools.ts`, `packages/arc-agi-3-chatgpt/src/types.ts`, `packages/arc-agi-3/src/avo-loop.ts`, `packages/arc-agi-3/src/plan-archive.ts`, … (+8 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • AX1 Captive dependencies — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in packages/harness/src/pool.ts, whose lifetimes are not modelled 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.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. User interface: 15 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. Boot: crawled PUBLIC routes only — add a Playwright storageState (e.g. playwright/.auth/user.json) or a test auth-setup to crawl authenticated screens rendered 0/1 surface(s) × 2 renders render failed for http://127.0.0.1:32768: page.addStyleTag: Refused to apply inline style because it violates the following Content Security Policy directive: "default-src 'none'". Either the 'unsafe-in ran the repo's playwright suite against the booted app but captured no surfaces (suite failed to install/run, or visited no pages) — see runtime diagnostics.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization 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 authorization controls.
  • C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit 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 audit controls.
  • C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention 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 retention controls.
  • C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights 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 data-subject rights controls.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • PF3 Async & latency hygiene — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 155 further occurrence(s) are not listed individually; the score already reflects all 195.
  • R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 220 further occurrence(s) are not listed individually; the score already reflects all 260.
  • R11 Import Boundaries — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 12 further occurrence(s) are not listed individually; the score already reflects all 52.
  • R2 Cyclomatic Complexity — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 323 further occurrence(s) are not listed individually; the score already reflects all 363.
  • R7 Dead Code — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 4 further occurrence(s) are not listed individually; the score already reflects all 44.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 25 further occurrence(s) are not listed individually; the score already reflects all 65.
  • X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X3 Exception handling — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 36 further occurrence(s) are not listed individually; the score already reflects all 76.
  • X7 Silent fallback defaults — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 14 further occurrence(s) are not listed individually; the score already reflects all 54.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run 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.
  • 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.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D22 Internal API Consistency: API consistency compares the call shapes of members that play the same role on the exposed C# surface: whether the API suits its callers is not measured, and surfaces in other languages are not measured.
  • D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D25 ADR Conformance: ADR conformance checks only decisions stated in a checkable form (a ruled-out element, package or dependency, an adr-rules block, a declared delivery status): a decision written only as prose is unverifiable, and decisions never written down are not checked.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • 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.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity3.8 / 10Weak✓ Tool-verified

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

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

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

190 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was production-replay.verifyProductionBindings at 99. A further 16 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being claim-gate.graderValid at 32 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs (k3_kernel_bench::dispatch at 20), packages/evals-extract/src/evaluator.ts (evaluator.clampLever at 17), packages/evals-hle/src/evaluator.ts (evaluator.clampLever at 17), packages/evals-math/src/evaluator.ts (evaluator.clampLever at 17). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

k3rs::json::value (cyclomatic 41) · ×4kimi-k3-harness/crates/k3rs/src/json.rs:76
Vm::builtin (cyclomatic 69) · ×3packages/oo-agents/crate/src/lib.rs:1066
ooa_cell_vm::jval (cyclomatic 32) · ×3packages/oo-agents/crate/src/lib.rs:129
Parser::primary (cyclomatic 22) · ×3packages/oo-agents/crate/src/lib.rs:661
production-replay.verifyProductionBindings (cyclomatic 99)packages/flywheel/src/production-replay.ts:13

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

What to do

  1. Bring the 12 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with production-replay.verifyProductionBindings (cyclomatic 99), ArcPlanArchive.load (cyclomatic 98), checkpoint.validateSupervisorState (cyclomatic 95). — 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 12 together lifts Cyclomatic Complexity from 3.8 to about 4.9/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

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

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

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

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

253 method(s) exceeded the cognitive complexity threshold of 15; the worst was sim.runSim at 191.

k3rs::json::value (cognitive 56) · ×9kimi-k3-harness/crates/k3rs/src/json.rs:76
horizon_core::extract_substitutions (cognitive 28) · ×5packages/horizon/crate/src/lib.rs:671
Vm::builtin (cognitive 98) · ×3packages/oo-agents/crate/src/lib.rs:1066
ooa_cell_vm::lex (cognitive 54) · ×3packages/oo-agents/crate/src/lib.rs:272
Parser::primary (cognitive 38) · ×3packages/oo-agents/crate/src/lib.rs:661

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

What to do

  1. Bring the 20 bodies over 60 down to 60 or less in Cognitive Complexity — start with sim.runSim (cognitive 191), meta-proxy-service.enableMetaProxyService (cognitive 146), checkpoint.validateSupervisorState (cognitive 126). — 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 20 together lifts Cognitive Complexity from 2.0 to about 3.9/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes8.5 / 10Strong✓ Tool-verified

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

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

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

69 god class(es) detected.

FunctionTooLong: official-factory.createOfficialArcControllerFactory · ×35packages/arc-agi-3-chatgpt/src/official-factory.ts:624
FileTooLong: src/controller.ts · ×18packages/arc-agi-3/src/controller.ts
MethodTooLong: ArcPlanArchive.load · ×9packages/arc-agi-3/src/plan-archive.ts:793
ClassTooLong: ArcController · ×5packages/arc-agi-3/src/controller.ts:281
TooManyMethods: ArcController · ×2packages/arc-agi-3/src/controller.ts:281

What to do

  1. Resolve the 35 FunctionTooLong finding(s) in God Classes — start with checkpoint.ts (2), official-factory.ts, HarnessBuilder.tsx. — One of this dimension's main actionable groups (35 warning-level).
  2. Resolve the 18 FileTooLong finding(s) in God Classes — start with controller.ts, store.ts, field-memory.ts. — One of this dimension's main actionable groups (18 warning-level).
  3. Resolve the 9 MethodTooLong finding(s) in God Classes — start with plan-archive.ts (2), field-memory.ts (2), store.ts (2). — One of this dimension's main actionable groups (9 warning-level).

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

D4 · Code Duplication9.8 / 10Stronggated by 36 serious findings✓ Tool-verified

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

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

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

24 duplicated block group(s) detected. 0.5 % of the production lines (682 of 145,523) are in a reported copy. A further 12 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 1 of the 36 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population. Measured on part of this repository only: .ts (84% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.

Duplicated block (11–12 lines × 2) · ×2docs/research/retort-placement/analyze2.py:68
Duplicated block (9 lines × 2) · ×2docs/research/retort-placement/analyze3.py:68
Duplicated block (14 lines × 2) · ×2packages/horizon/crate/src/lib.rs:98
Duplicated block (12 lines × 2) · ×2packages/oo-agents/crate/src/lib.rs:632
Duplicated block (7 lines × 2) · ×2kimi-k3-harness/crates/k3rs/src/ops.rs:326

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

What to do

  1. Resolve the 2 Duplicated block (11–12 lines × 2) finding(s) in Code Duplication — start with analyze2.py, dispatch.rs. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 2 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with analyze3.py, ops.rs. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with lib.rs (2). — One of this dimension's main actionable groups (2 warning-level).

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

D5 · Coupling8.4 / 10Strong✓ Tool-verified

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

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

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

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

56 production modules (Cargo+npm), 0 dependency cycle(s), 1 unstable depended-on module(s). Read from the build's own module declarations; 11 module(s) off the main sequence, with abstractness counted on 53 of the 56 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: @metaharness/turn-credit · ×10
Unstable project metaharness
Off the main sequence: ruflo-kernel

What to do

  1. Resolve the 10 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (10 warning-level).
  2. Resolve the 1 Unstable project metaharness finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).

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

D6 · Cohesion (LCOM4)9.9 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

1 of 94 classes have LCOM4 above 3.

Low cohesion: RuvSecurityMemory (LCOM4 4)packages/darwin-mode/src/security/memory.ts:111

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with memory.ts. — One of this dimension's main actionable groups (1 warning-level).

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

D7 · Architectural Integrity6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the code respects its intended layering / architecture rules.

Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.

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

No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).

Detailed fixes: d7_recommendation.md.

D10 · Test Quality10.0 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

14 skipped (13 with a documented reason), 0 zero-assertion, 1 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 3846 tests. Measured on the JavaScript/TypeScript suite only — at least 7 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.

Skipped test: (skipped: no Directory server reachable at ${TEST_SERVER_ADDRESS} — run docker compose up in agntcy/dir's install/docker/ to exercise this test live)packages/agntcy/src/oasf/__tests__/publish.test.ts:213
Fixed-sleep synchronisation: serializes concurrent callers so only one request is in flightpackages/arc-agi-3/__tests__/python-bridge.test.ts:305
Skipped (documented): (unnamed test) · ×13packages/kernel-js/__tests__/loader.test.ts:153

What to do

  1. Resolve the 1 Skipped test finding(s) in Test Quality — start with publish.test.ts. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 Fixed-sleep synchronisation finding(s) in Test Quality — start with python-bridge.test.ts. — One of this dimension's main actionable groups (1 warning-level).

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

D11 · Test Reliability4.0 / 10Weak✓ 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.

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

3 flaky across 1 measured tier(s). JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in the repository root (3828 tests); vitest via `npm ci --ignore-scripts` in apps/web-ui/ (72 tests); vitest via `npm ci --ignore-scripts` in kimi-k3-harness/ (4 tests); vitest via `npm ci --ignore-scripts` in packages/agent-harness-generator-lib/ (0 tests); vitest via `npm ci --ignore-scripts` in packages/agntcy/ (82 tests); vitest via `npm ci --ignore-scripts` in packages/arc-agi-3/ (91 tests); vitest via `npm ci --ignore-scripts` in packages/arc-agi-3-bench/ (11 tests); vitest via `npm ci --ignore-scripts` in packages/arc-agi-3-chatgpt/ (70 tests); vitest via `npm ci --ignore-scripts` in packages/autogenous/ (0 tests); vitest via `npm ci --ignore-scripts` in packages/avo/ (55 tests); vitest via `npm ci --ignore-scripts` in packages/aws-finops/ (34 tests); vitest via `npm ci --ignore-scripts` in packages/bench/ (148 tests)): measured (3 flaky).

Flaky test: the repository rootpackages/darwin-mode/__tests__/security/real-loop.test.ts::real semgrep as the in-loop judge does NOT promote a candidate equal to the incumbent (no improvement) · ×3

What to do

  1. Resolve the 3 Flaky test finding(s) in Test Reliability. — One of this dimension's main actionable groups (3 issue-level).

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

D13 · Secret Scanning0.0 / 10Critical✓ Tool-verified

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

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

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

4 secret(s) detected.

REDACTED

What to do

  1. Resolve the 5 Leaked secret finding(s) in Secret Scanning — start with REDACTED (5). — One of this dimension's main actionable groups (5 issue-level).

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

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

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

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

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

0 of 299 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository commits no Cargo.lock, so its graph was resolved here: its manifests' `[dependencies]` and `[build-dependencies]` closed over the crates.io index, each crate at the newest release its requirement admits (what a fresh `cargo generate-lockfile` picks, not a graph the repository has pinned). Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.7 / 10Stronggated by 16 serious findings✓ Tool-verified

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

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

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

Top hotspots: packages/create-agent-harness/src/index.ts (10×50=500); packages/flywheel/src/replay.ts (4×48=192); REDACTED (3×51=153) Repeated repair below the complexity floor: scripts/dream-release.mjs (6 of 7 changes were fixes)

Hotspot: packages/create-agent-harness/src/index.ts · ×15packages/create-agent-harness/src/index.ts:681
Repeated repair: scripts/dream-release.mjsscripts/dream-release.mjs:17

What to do

  1. Resolve the 15 Hotspot finding(s) in Churn × Complexity Hotspots — start with index.ts, replay.ts, REDACTED. — One of this dimension's main actionable groups (15 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with dream-release.mjs. — One of this dimension's main actionable groups (1 warning-level).

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

D17 · Explicit Debt10.0 / 10Stronggated by 5 serious findings✓ Tool-verified

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

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

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

5 deducted task-comment markers across 103794 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.

TodoComment · ×5services/apicompletions/src/firestore/client.ts:77

What to do

  1. Resolve the 5 TodoComment finding(s) in Explicit Debt — start with codeql-oracle.ts (2), client.ts, index.ts. — One of this dimension's main actionable groups (5 warning-level).

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

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

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

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

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

2 of 2 documentation facets pass in full. 214 document(s) read across 87 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

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

3 of 250 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question, a date that is no calendar day). How well each record argues its case is not measured.

ADR superseded but its status says otherwise · ×2docs/adrs/ADR-108-darwin-evolution-series-synthesis.md:3detected by adr-integrity
ADR declares no statusdocs/adrs/ADR-271-avo-receipts-as-flywheel-gate-evidence.md:1detected by adr-integrity

✓ On the Gold path — maintain.

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

D21 · Naming Consistency3.3 / 10Weak✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

1 naming inconsistencies among 15 declarations measured against a convention their peers follow.

`callLLM` spells `LLM` where 14 names in the project spell it `Llm`packages/darwin-mode/bench/ruvector/h3-code-localize.mjs:79

What to do

  1. Resolve the 1 `callLLM` spells `LLM` where 14 names in the project spell it `Llm` finding(s) in Naming Consistency — start with h3-code-localize.mjs. — One of this dimension's main actionable groups (1 recommendation-level).

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

D22 · Internal API Consistency10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the internal API surface is consistent and coherent.

Method: Call-shape rules (A1-A9) over the structured code model of the intentionally exposed C# surface: members of one type, overloads of one name and the same slot across sibling types are compared, and a member that makes a caller use a different convention for the same kind of operation is flagged. Deterministic, no model. Advisory.

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

0 API inconsistencies among 181 exposed members measured against a convention their peers follow.

✓ On the Gold path — maintain.

Detailed fixes: d22_recommendation.md.

D23 · Boundary Type-Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.

Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.

Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.

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

17 domain type(s) cross context boundaries across 44 contexts; they are measured and withheld (not published, not scored). Contexts: agntcy, arc-agi-3, arc-agi-3-bench, arc-agi-3-chatgpt, autogenous, avo, aws-finops, bench, create-agent-harness, darwin-mode, evals-extract, evals-hle and 32 more.

✓ On the Gold path — maintain.

Detailed fixes: d23_recommendation.md.

D24 · Comment Value9.7 9.2 / 10Exemplary✓ Tool-verified

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

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

Maturity: Documented → Verified → Prevented · effective 9.2 / 10 · rule-coverage 95% · ceiling Documented

15 of 4446 judged comments only repeat the code they sit on (0.3 %). 326 comment(s) in another language or script were not judged.

redundant comment · ×15packages/create-agent-harness/src/genome.ts:135
doc comments repeat the names · ×3packages/bench/src/index.ts:64

✓ On the Gold path — maintain.

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

D25 · ADR Conformance8.3 / 10Strong✓ Tool-verified

What it measures: Whether the code actually follows the decisions recorded in the project's ADRs.

Method: Each binding ADR read for checkable forms: a backticked element its Decision section rules out, a ruled-out package the manifests declare, a forbidden module dependency, an opt-in adr-rules block, and a declared delivery status the code does not yet carry. A prose decision with no checkable form is unverifiable, neither a finding nor a pass. Deterministic, no model. Advisory.

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

2 of 12 checkable records are broken by the code or by their own declared delivery (12 of 144 binding records state a rule in checkable form or declare their delivery; prose decisions are unverifiable).

ADR not followed: ADR-248: @metaharness/turn-credit — offline recursive turn-level credit assignment (AgentOPSD) · ×3docs/adrs/ADR-248-turn-credit.md:46detected by adr-prohibition

What to do

  1. Resolve the 3 ADR not followed finding(s) in ADR Conformance — start with ADR-248-turn-credit.md (2), ADR-279-flywheel-sequential-evidence-wiring.md. — One of this dimension's main actionable groups (3 recommendation-level).

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

D26 · Project Cohesion9.0 / 10Strong✓ Tool-verified

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

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

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

3 of 58 build units (Cargo, Python, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×3packages/darwin-mode/package.json:1

What to do

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

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

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

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

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

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

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

4 % of calls cross a namespace and 0 % go through an interface, but 89 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.0 / 10Critical✓ Tool-verified

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

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

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

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

57 finding(s): 0 critical, 24 high, 30 medium, 3 low. semgrep hit a parse error in 259 file(s) — `packages/arc-agi-3-chatgpt/__tests__/official-factory.test.ts` (line 45), `packages/arc-agi-3-chatgpt/src/official-avo-runtime.ts` (line 17), `packages/arc-agi-3-chatgpt/src/tools.ts` (line 665), `packages/arc-agi-3-chatgpt/src/types.ts` (lines 137–138), `packages/arc-agi-3/src/avo-loop.ts` (line 126), … (+254 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. 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
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  3. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).

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

D30 · Dependency Vulnerabilities9.6 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

2 finding(s): 0 critical, 0 high, 2 medium, 0 low.

REDACTED

What to do

  1. 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.

D31 · IaC & Container Security9.1 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

5 finding(s): 0 critical, 2 high, 2 medium, 1 low.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 2 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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.

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

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 665 of the 798 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & Signing7.5 / 10Strong✓ Tool-verified

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.

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

3/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

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.

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

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life6.0 / 10Adequate✓ Tool-verified

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.

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

1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 2 platform declaration(s) and 2 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.

End-of-life runtime: Rust 1.88rust-toolchain.toml:1

What to do

  1. Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with rust-toolchain.toml. — One of this dimension's main actionable groups (1 warning-level).

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

Frontend & cross-cutting dimensions

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

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

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

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

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

  • A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. — REDACTED:66

What to do

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

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

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

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

  • This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. — apps/web-ui/public/cost-pareto.html:270
  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — apps/web-ui/public/cost-pareto.html:271

What to do

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

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

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

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

  • A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. — REDACTED:2

What to do

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

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

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

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

  • An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. (×8) — apps/web-ui/public/cost-pareto.html:310, apps/web-ui/public/cost-pareto.html:311, apps/web-ui/public/cost-pareto.html:312, …
  • This <span> carries its own click handler, but it sits inside a <button> that performs a different action. A keyboard user reaches the <button> and activating it runs the <button>'s handler, never this one, so this action has no keyboard path at all. Role and tabindex cannot supply one: HTML forbids a <button> from containing interactive content or any descendant with a tabindex, so the browser will not put this element in the tab order however it is marked up. Move it out of the <button> and make it a sibling <button>, so each action has its own control. — apps/web-ui/src/components/CatalogPicker.tsx:62
  • This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. — apps/web-ui/src/components/OnboardingModal.tsx:158

What to do

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

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

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

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

AC6 · Visual & motion safety4.9 / 10Adequate✓ Tool-verified

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

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

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

  • `.calcpanel` moves (`transition: transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — apps/web-ui/public/cost-pareto.html:98
  • `.book` moves (`transition: transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — apps/web-ui/public/cost-pareto.html:120
  • `.bookmain section` moves (`animation: fadein .4s ease both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — apps/web-ui/public/cost-pareto.html:134
  • `.anim-bar` moves (`animation: growbar 1s ease both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — apps/web-ui/public/cost-pareto.html:153
  • `.wcard` moves (`transition: transform .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — apps/web-ui/public/cost-pareto.html:200
  • <circle> moves — its inline style sets `animation: fadein .5s 1.2s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — apps/web-ui/public/cost-pareto.html:447
  • <circle> moves — its inline style sets `animation: fadein .5s 1.4s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — apps/web-ui/public/cost-pareto.html:448
  • <circle> moves — its inline style sets `animation: fadein .5s 1.6s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — apps/web-ui/public/cost-pareto.html:449
  • `.input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — apps/web-ui/src/index.css:47

What to do

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

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

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

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

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

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

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

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

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

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

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

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

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

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

ES1 · Fold determinism10.0 / 10Exemplary✓ Tool-verified

Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.

Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.

ES2 · Immutable events10.0 / 10Exemplary✓ Tool-verified

Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.

Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

IC1 · Incompleteness & stubs9.0 / 10Exemplary✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition. — REDACTED:360
  • A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. — packages/agntcy/src/oasf/__tests__/publish.test.ts:213
  • `flushDurableFacts` has an empty body — confirm it's an intentional no-op and not an unfinished method. — packages/horizon/scripts/demo.mjs:37

What to do

  • Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
M1 · Documentation (README)9.8 / 10Exemplary✓ Tool-verified

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

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

M2 · Architecture documentation10.0 / 10Exemplary✓ Tool-verified

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

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

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

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

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

M4 · Documentation accuracy9.1 / 10Exemplary✓ Tool-verified

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

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

  • packages/agntcy/README.md names Node.js 22, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, pinned 20. 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. — packages/agntcy/README.md:44
  • docs/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md names ReAct 41, but the manifest declares `react` ^18.3.1. 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/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md:399

What to do

  • Reconcile the README with reality: packages/agntcy/README.md names Node.js 22, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, pinned 20; docs/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md names ReAct 41, but the manifest declares `react` ^18.3.1.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability7.1 / 10Strong✓ Tool-verified

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

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

  • Only 1/51 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/poker-darwin`, `examples-packages/claude-code`, `examples-packages/codex`, `examples-packages/coding` and 45 more.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
P3 · Security & performance tooling8.0 / 10Strong✓ Tool-verified

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

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

What to do

  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

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.

  • Deployment is orchestrated by compose, and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no compose service declares a `healthcheck:` that uses them and nothing pins a previous image to fall back to — so a release that starts but does not serve looks healthy, and reversing it is a manual step. — .github/workflows/dream-release.yml:157

What to do

  • Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
P5 · DR & Backup4.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

What to do

  • Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
  • No persistence guard on critical data stores — use Docker named volumes (or your orchestrator's persistent-volume equivalent) so the data store can't be wiped by a container recreate (or, in cloud, set purge-protection / soft-delete / prevent_destroy).
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.

Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.

  • `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — services/apicompletions/src/providers/openrouter.ts:30

What to do

  • Bound every outbound call: pass `signal: AbortSignal.timeout(ms)` to `fetch`, set `timeout` on the axios instance (`axios.create({ timeout })`), and add retries with back-off (`axios-retry`, `p-retry`) and a breaker (`opossum`, `cockatiel`) around dependencies that fail.
PF1 · Benchmark discipline9.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

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

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

  • `writeFileSync` in `dispatch` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/avo/src/cli.ts:52
  • `readFileSync` in `dispatch` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/avo/src/cli.ts:68
  • `existsSync` in `create` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/avo/src/memory.ts:66
  • `existsSync` in `fork` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/avo/src/repository.ts:52
  • `existsSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/analyze-repo.ts:382
  • `statSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/analyze-repo.ts:382
  • `writeFileSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — packages/create-agent-harness/src/analyze-repo.ts:395, packages/create-agent-harness/src/analyze-repo.ts:396
  • `existsSync` in `auditCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — packages/create-agent-harness/src/audit-cmd.ts:44, packages/create-agent-harness/src/audit-cmd.ts:55
  • `existsSync` in `readManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/compare-cmd.ts:68
  • `existsSync` in `buildDiagReport` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/diag.ts:212
  • `existsSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — packages/create-agent-harness/src/diag.ts:413, packages/create-agent-harness/src/diag.ts:434, packages/create-agent-harness/src/diag.ts:443
  • `readFileSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — packages/create-agent-harness/src/diag.ts:415, packages/create-agent-harness/src/diag.ts:436
  • `readdirSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/diag.ts:445
  • `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×5) — packages/create-agent-harness/src/eject.ts:70, packages/create-agent-harness/src/eject.ts:78, packages/create-agent-harness/src/eject.ts:83, …
  • `existsSync` in `applyEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/eject.ts:135
  • `existsSync` in `buildExportedConfig` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×4) — packages/create-agent-harness/src/export-config.ts:53, packages/create-agent-harness/src/export-config.ts:64, packages/create-agent-harness/src/export-config.ts:76, …
  • `existsSync` in `exportConfigCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/export-config.ts:127
  • `existsSync` in `loadState` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/federate.ts:38
  • `existsSync` in `genomeCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/genome.ts:233
  • `statSync` in `genomeCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/genome.ts:233
  • `writeFileSync` in `genomeCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/genome.ts:244
  • `existsSync` in `renderScaffold` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/index.ts:687
  • `existsSync` in `scaffold` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/index.ts:882
  • `mkdtempSync` in `runMetaHarnessSubcommand` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/index.ts:991
  • `spawnSync` in `runMetaHarnessSubcommand` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/index.ts:993
  • `existsSync` in `runLearn` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — packages/create-agent-harness/src/learn.ts:244, packages/create-agent-harness/src/learn.ts:257
  • `spawnSync` in `runLearn` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — packages/create-agent-harness/src/learn.ts:270

What to do

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

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

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

R10 · Code Duplication5.6 / 10Adequate✓ Tool-verified

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

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

  • 95 duplicated blocks under packages/ have copies in at least two of the sibling directories agntcy, arc-agi-3, arc-agi-3-chatgpt, avo, create-agent-harness, darwin-mode (+24 more sibling(s) not listed) — 78 of them are reported below, and 17 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 95 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 95 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 95 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — packages/evals-hle/src/evaluator.ts:7
  • 19 of the duplicated blocks reported below have copies in at least two of the sibling directories claude-code, codex, coding, copilot, devops, education (+30 more sibling(s) not listed) under examples-packages/. That concentration is one structural fact, not 19 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 19 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — examples-packages/example-ads/bin/scaffold.mjs:16
  • 15 duplicated blocks under the repository root have copies in at least two of the sibling directories apps, experiments, kimi-k3-harness, packages, scripts, services — 11 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 15 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 15 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 15 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — apps/web-ui/src/generator/scaffold.ts:195
  • 7 duplicated blocks under experiments/ have copies in at least two of the sibling directories credit-feedback, router-calibration-loop, signal-flywheel, turn-credit-acceptance — 6 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — experiments/credit-feedback/lib.mjs:28
  • REDACTED:41 · REDACTED:53 — the two spans are one implementation copied and then locally edited — 1210 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:41
  • packages/evals-hle/src/evaluator.ts:7 · packages/evals-math/src/evaluator.ts:7 — these 2 files are line-for-line copies of one another — 114 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — packages/evals-hle/src/evaluator.ts:7
  • apps/web-ui/src/generator/scaffold.ts:195 · packages/create-agent-harness/src/host-config.ts:62 — the two spans are one implementation copied and then locally edited — 856 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — apps/web-ui/src/generator/scaffold.ts:195
  • packages/evals-hle/src/genome.ts:14 · packages/evals-math/src/genome.ts:16 — these 2 files are line-for-line copies of one another — 78 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — packages/evals-hle/src/genome.ts:14
  • packages/evals-hle/src/evaluator.ts:79 · packages/evals-math/src/evaluator.ts:79 · packages/evals-sql/src/evaluator.ts:82 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/evals-hle/src/evaluator.ts:79
  • experiments/credit-feedback/lib.mjs:28 · experiments/turn-credit-acceptance/lib.mjs:27 — the two spans are one implementation copied and then locally edited — 527 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/credit-feedback/lib.mjs:28
  • packages/darwin-mode/src/archive.ts:40 · packages/darwin-mode/src/numeric-archive.ts:17 — the two spans are one implementation copied and then locally edited — 546 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/darwin-mode/src/archive.ts:40
  • examples-packages/example-ads/bin/scaffold.mjs:16 · examples-packages/example-aws/bin/scaffold.mjs:16 · examples-packages/example-azure/bin/scaffold.mjs:16 · examples-packages/example-bio/bin/scaffold.mjs:16 · +14 more site(s) not listed — the 18 copies are spread across 18 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 18 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — examples-packages/example-ads/bin/scaffold.mjs:16
  • packages/evals-extract/src/data.ts:36 · packages/evals-hle/src/data.ts:32 · packages/evals-math/src/data.ts:31 · packages/evals-sql/src/data.ts:34 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-extract/src/data.ts:36
  • apps/web-ui/src/generator/repo.ts:233 · packages/create-agent-harness/src/analyze-repo.ts:163 — the two spans are one implementation copied and then locally edited — 706 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — apps/web-ui/src/generator/repo.ts:233
  • kimi-k3-harness/scripts/flywheel-evolve.mjs:39 · packages/radio/scripts/flywheel-radio.mjs:89 — the two spans are one implementation copied and then locally edited — 561 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — kimi-k3-harness/scripts/flywheel-evolve.mjs:39
  • packages/evals-hle/src/leakage.ts:20 · packages/evals-math/src/leakage.ts:20 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — packages/evals-hle/src/leakage.ts:20
  • packages/evals-extract/src/data.ts:36 · packages/evals-hle/src/data.ts:32 · packages/evals-math/src/data.ts:31 · packages/evals-servedmodel/src/data.ts:25 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-extract/src/data.ts:36
  • packages/evals-hle/src/data.ts:49 · packages/evals-toolcall/src/data.ts:57 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-hle/src/data.ts:49
  • packages/evals-hle/src/score.ts:11 · packages/evals-math/src/score.ts:11 — these 2 files are line-for-line copies of one another — 52 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — packages/evals-hle/src/score.ts:11
  • packages/evals-extract/src/leakage.ts:24 · packages/evals-hle/src/leakage.ts:24 · packages/evals-math/src/leakage.ts:24 · packages/evals-sql/src/leakage.ts:24 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/evals-extract/src/leakage.ts:24
  • packages/darwin-mode/src/openrouter-mutator.ts:66 · packages/darwin-mode/src/requesty-mutator.ts:58 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/darwin-mode/src/openrouter-mutator.ts:66
  • packages/evals-extract/src/evaluator.ts:125 · packages/evals-hle/src/evaluator.ts:112 · packages/evals-math/src/evaluator.ts:112 · packages/evals-sql/src/evaluator.ts:115 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-extract/src/evaluator.ts:125
  • packages/evals-extract/src/genome.ts:15 · packages/evals-hle/src/genome.ts:13 · packages/evals-math/src/genome.ts:15 — the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/evals-extract/src/genome.ts:15
  • packages/evals-hle/src/verifier.ts:10 · packages/evals-math/src/verifier.ts:11 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — packages/evals-hle/src/verifier.ts:10
  • packages/evals-sql/src/genome.ts:17 · packages/evals-toolcall/src/genome.ts:19 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/evals-sql/src/genome.ts:17
  • packages/evals-extract/src/score.ts:38 · packages/evals-hle/src/score.ts:38 · packages/evals-math/src/score.ts:38 · packages/evals-sql/src/score.ts:38 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/evals-extract/src/score.ts:38
  • packages/create-agent-harness/src/genome.ts:197 · packages/create-agent-harness/src/threat-model.ts:209 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/create-agent-harness/src/genome.ts:197
  • packages/darwin-mode/src/refine-mutator.ts:31 · packages/darwin-mode/src/ruvllm-mutator.ts:26 — the two spans are one implementation copied and then locally edited — 265 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/darwin-mode/src/refine-mutator.ts:31
  • packages/evals-hle/src/normalizer.ts:9 · packages/evals-math/src/normalizer.ts:10 — the two spans are one implementation copied and then locally edited — 366 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/evals-hle/src/normalizer.ts:9
  • packages/redblue/src/cli/index.ts:502 · packages/weight-eft/src/cli.ts:176 — the two spans are one implementation copied and then locally edited — 236 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/redblue/src/cli/index.ts:502
  • apps/web-ui/src/generator/render.ts:19 · packages/create-agent-harness/src/renderer.ts:32 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — apps/web-ui/src/generator/render.ts:19
  • packages/evals-extract/src/calibration.ts:10 · packages/evals-hle/src/calibration.ts:10 · packages/evals-math/src/calibration.ts:10 · packages/evals-sql/src/calibration.ts:10 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/evals-extract/src/calibration.ts:10
  • packages/evals-extract/src/gate.ts:26 · packages/evals-hle/src/gate.ts:29 · packages/evals-math/src/gate.ts:29 · packages/evals-sql/src/gate.ts:30 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — packages/evals-extract/src/gate.ts:26
  • packages/evals-math/src/verifier.ts:31 · packages/evals-toolcall/src/verifier.ts:41 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — packages/evals-math/src/verifier.ts:31
  • packages/horizon/src/core.ts:15 · packages/oo-agents/src/vm.ts:34 — the two spans are one implementation copied and then locally edited — 248 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — packages/horizon/src/core.ts:15
  • packages/evals-extract/src/evaluator.ts:125 · packages/evals-hle/src/evaluator.ts:112 · packages/evals-math/src/evaluator.ts:112 · packages/evals-servedmodel/src/evaluator.ts:48 · +2 more site(s) not listed — the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-extract/src/evaluator.ts:125
  • packages/evals-extract/src/routing.ts:11 · packages/evals-hle/src/routing.ts:10 · packages/evals-math/src/routing.ts:10 · packages/evals-sql/src/routing.ts:11 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — packages/evals-extract/src/routing.ts:11
  • packages/evals-extract/src/genome.ts:90 · packages/evals-hle/src/genome.ts:88 · packages/evals-math/src/genome.ts:93 · packages/evals-sql/src/genome.ts:97 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — packages/evals-extract/src/genome.ts:90
  • examples-packages/devops/bin/scaffold.mjs:2 · examples-packages/sales/bin/scaffold.mjs:2 — the two spans are one implementation copied and then locally edited — 118 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — examples-packages/devops/bin/scaffold.mjs:2
  • examples-packages/coding/bin/scaffold.mjs:5 · examples-packages/github-actions/bin/scaffold.mjs:5 · examples-packages/opencode/bin/scaffold.mjs:5 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — examples-packages/coding/bin/scaffold.mjs:5

What to do

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

React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).

Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.

  • __tests__/cli-flags-completions.test.ts:4 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/cli-flags-completions.test.ts:4
  • __tests__/dream-explicit-new.test.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/dream-explicit-new.test.ts:2
  • __tests__/dream-explicit-new.test.ts:13 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/dream-explicit-new.test.ts:13
  • __tests__/dream-explicit-new.test.ts:14 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/dream-explicit-new.test.ts:14
  • __tests__/dream-explicit-new.test.ts:30 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/dream-explicit-new.test.ts:30
  • __tests__/e2e-lifecycle.test.ts:34 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:34
  • __tests__/e2e-lifecycle.test.ts:35 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:35
  • __tests__/e2e-lifecycle.test.ts:36 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:36
  • __tests__/e2e-lifecycle.test.ts:37 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:37
  • __tests__/e2e-lifecycle.test.ts:38 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:38
  • __tests__/e2e-lifecycle.test.ts:39 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:39
  • __tests__/e2e-lifecycle.test.ts:40 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:40
  • __tests__/e2e-lifecycle.test.ts:41 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:41
  • __tests__/e2e-lifecycle.test.ts:42 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/federate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:42
  • __tests__/e2e-lifecycle.test.ts:43 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/diag.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-lifecycle.test.ts:43
  • __tests__/e2e-scaffold-validate.test.ts:19 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-scaffold-validate.test.ts:19
  • __tests__/e2e-scaffold-validate.test.ts:20 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-scaffold-validate.test.ts:20
  • __tests__/e2e-scaffold-validate.test.ts:97 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/e2e-scaffold-validate.test.ts:97
  • __tests__/harness-sbom-audit.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/harness-sbom-audit.test.ts:7
  • __tests__/harness-sbom-audit.test.ts:8 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/harness-sbom-audit.test.ts:8
  • __tests__/mcp-cmd.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/mcp-cmd.test.ts:7
  • __tests__/mcp-dispatch-integration.test.ts:15 reaches past another workspace package's public entry into its internals with a relative path (../packages/kernel-js/src/dispatch.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/mcp-dispatch-integration.test.ts:15
  • __tests__/publish-cmd.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/publish-cmd.test.ts:7
  • __tests__/upgrade-cmd.test.ts:8 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/upgrade-cmd.test.ts:8
  • __tests__/upgrade-cmd.test.ts:9 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/upgrade-cmd.test.ts:9
  • __tests__/witness-tamper.test.ts:20 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/witness-client.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — __tests__/witness-tamper.test.ts:20
  • experiments/credit-feedback/assert.mjs:18 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) — import the package by name instead. — experiments/credit-feedback/assert.mjs:18
  • experiments/credit-feedback/lib.mjs:19 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) — import the package by name instead. — experiments/credit-feedback/lib.mjs:19
  • experiments/router-calibration-loop/lib.mjs:22 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) — import the package by name instead. — experiments/router-calibration-loop/lib.mjs:22
  • experiments/router-calibration-loop/lib.mjs:28 reaches into another package with a relative path (../../packages/router/dist/index.js) — import the package by name instead. — experiments/router-calibration-loop/lib.mjs:28
  • experiments/signal-flywheel/config.mjs:19 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) — import the package by name instead. — experiments/signal-flywheel/config.mjs:19
  • experiments/signal-flywheel/config.mjs:25 reaches into another package with a relative path (../../packages/darwin-mode/dist/scorer.js) — import the package by name instead. — experiments/signal-flywheel/config.mjs:25
  • experiments/signal-flywheel/run.mjs:20 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) — import the package by name instead. — experiments/signal-flywheel/run.mjs:20
  • experiments/signal-flywheel/verify.mjs:21 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) — import the package by name instead. — experiments/signal-flywheel/verify.mjs:21
  • experiments/turn-credit-acceptance/assert.mjs:12 reaches into another package with a relative path (../../packages/flywheel/dist/receipts.js) — import the package by name instead. — experiments/turn-credit-acceptance/assert.mjs:12
  • experiments/turn-credit-acceptance/lib.mjs:18 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) — import the package by name instead. — experiments/turn-credit-acceptance/lib.mjs:18
  • experiments/turn-credit-acceptance/run.mjs:22 reaches into another package with a relative path (../../packages/flywheel/dist/receipts.js) — import the package by name instead. — experiments/turn-credit-acceptance/run.mjs:22
  • experiments/user-awareness/probe.mjs:35 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) — import the package by name instead. — experiments/user-awareness/probe.mjs:35
  • packages/create-agent-harness/__tests__/generated-fitness.test.ts:10 reaches past another workspace package's public entry into its internals with a relative path (../../darwin-mode/src/repo_profiler.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/create-agent-harness/__tests__/generated-fitness.test.ts:10
  • packages/create-agent-harness/__tests__/generated-fitness.test.ts:11 reaches past another workspace package's public entry into its internals with a relative path (../../darwin-mode/src/generator.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead. — packages/create-agent-harness/__tests__/generated-fitness.test.ts:11

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic Complexity6.0 / 10Adequate✓ Tool-verified

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

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

  • verifyProductionBindings has cyclomatic complexity 96 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/production-replay.ts:13
  • runProductionFlywheel has cyclomatic complexity 93 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/production-run.ts:12
  • validateSupervisorState has cyclomatic complexity 93 and cognitive complexity 125; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/checkpoint.ts:476
  • load has cyclomatic complexity 88 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/plan-archive.ts:793
  • runSim has cyclomatic complexity 82 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/radio/src/sim.ts:451
  • (anonymous) has cyclomatic complexity 81 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3-chatgpt/src/official-factory.ts:1033
  • (anonymous) has cyclomatic complexity 71 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/darwin-mode/src/safety-ast.ts:175
  • validateTransitionReceiptSchema has cyclomatic complexity 70 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/receipts.ts:244
  • enableMetaProxyService has cyclomatic complexity 68 and cognitive complexity 152; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/create-agent-harness/src/meta-proxy-service.ts:392
  • validateCheckpointCrossFields has cyclomatic complexity 65 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/checkpoint.ts:741
  • main has cyclomatic complexity 63 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/nightly-sota-review.mjs:340
  • commit has cyclomatic complexity 61 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/memory.ts:254
  • validateBeliefGraphSnapshot has cyclomatic complexity 61 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/belief-graph.ts:77
  • run has cyclomatic complexity 59 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:421
  • commitTypedSupervisorDirective has cyclomatic complexity 59 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/supervisor.ts:220
  • evolve has cyclomatic complexity 57 and cognitive complexity 122; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/darwin-mode/src/evolve.ts:311
  • verifyMultiGenerationEvidence has cyclomatic complexity 57 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/multigeneration-proof.ts:276
  • metaProxyCmd has cyclomatic complexity 56 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:741
  • preregistrationValid has cyclomatic complexity 53 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/avo/src/claim-gate.ts:462
  • evolveNumeric has cyclomatic complexity 52 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/darwin-mode/src/numeric-evolve.ts:57
  • validateCheckpointSchema has cyclomatic complexity 52 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/checkpoint.ts:341
  • validateExpectation has cyclomatic complexity 51 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/canonical.ts:719
  • disableMetaProxyService has cyclomatic complexity 50 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/create-agent-harness/src/meta-proxy-service.ts:682
  • verifyReplayBundle has cyclomatic complexity 47 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/replay.ts:96
  • verifyCompletionCertificate has cyclomatic complexity 45 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/horizon/src/completion.ts:76
  • validateProductionManifest has cyclomatic complexity 45 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/production-gate.ts:186
  • renderScaffold has cyclomatic complexity 44 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/create-agent-harness/src/index.ts:681
  • addCandidates has cyclomatic complexity 44 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/plan-archive.ts:390
  • vectorAudit has cyclomatic complexity 44 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/sota-attest.mjs:163
  • #verifyCheckpointBindings has cyclomatic complexity 44 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/avo-loop.ts:657
  • runFlywheelGenerations has cyclomatic complexity 41 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/run.ts:91
  • validateCheckpointBeliefHistory has cyclomatic complexity 41 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/checkpoint.ts:881
  • validateStoredRule has cyclomatic complexity 40 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/arc-agi-3/src/memory.ts:150
  • verifyEvidenceBundle has cyclomatic complexity 39 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/avo/src/claim-gate.ts:573
  • auditCmd has cyclomatic complexity 38 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/create-agent-harness/src/audit-cmd.ts:20
  • (anonymous) has cyclomatic complexity 38 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/redblue/src/mock-target.ts:48
  • gatedSubmit has cyclomatic complexity 37 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/redblue/src/integrations/h1-submit.ts:160
  • retrieveContrastiveExperiences has cyclomatic complexity 37 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/darwin-mode/src/contrastive/memory.ts:75
  • parseRecord has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/field-memory/src/field-memory.ts:450
  • createProductionManifest has cyclomatic complexity 37 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — packages/flywheel/src/production-gate.ts:90
R3 · Large Files7.6 / 10Strong✓ Tool-verified

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

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

  • packages/arc-agi-3/src/controller.ts has 1437 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/controller.ts:1
  • packages/arc-agi-3-chatgpt/src/store.ts has 1270 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3-chatgpt/src/store.ts:1
  • packages/field-memory/src/field-memory.ts has 1209 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/field-memory/src/field-memory.ts:1
  • packages/create-agent-harness/src/index.ts has 1189 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/create-agent-harness/src/index.ts:1
  • packages/arc-agi-3-chatgpt/src/official-factory.ts has 1188 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3-chatgpt/src/official-factory.ts:1
  • packages/arc-agi-3/src/checkpoint.ts has 1093 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/checkpoint.ts:1
  • packages/arc-agi-3/src/plan-archive.ts has 1026 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/plan-archive.ts:1
  • packages/arc-agi-3/src/python-bridge.ts has 906 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/python-bridge.ts:1
  • packages/radio/src/sim.ts has 872 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/radio/src/sim.ts:1
  • packages/arc-agi-3/src/canonical.ts has 843 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/canonical.ts:1
  • packages/redblue/src/integrations/hackerone.ts has 838 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/redblue/src/integrations/hackerone.ts:1
  • packages/arc-agi-3/src/avo-loop.ts has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/avo-loop.ts:1
  • REDACTED has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/create-agent-harness/src/meta-proxy-service.ts has 794 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/create-agent-harness/src/meta-proxy-service.ts:1
  • REDACTED has 748 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/avo/src/claim-gate.ts has 712 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/avo/src/claim-gate.ts:1
  • packages/arc-agi-3-chatgpt/src/tools.ts has 685 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3-chatgpt/src/tools.ts:1
  • packages/darwin-mode/src/evolve.ts has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/darwin-mode/src/evolve.ts:1
  • packages/arc-agi-3/src/receipts.ts has 591 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/receipts.ts:1
  • REDACTED has 580 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/arc-agi-3/src/types.ts has 552 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/types.ts:1
  • packages/redblue/src/cli/index.ts has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/redblue/src/cli/index.ts:1
  • packages/oo-agents/src/pod.ts has 507 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/oo-agents/src/pod.ts:1
  • packages/host-prime-agent/src/index.ts has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/host-prime-agent/src/index.ts:1
  • packages/arc-agi-3/src/memory.ts has 479 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/memory.ts:1
  • apps/web-ui/src/generator/scaffold.ts has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — apps/web-ui/src/generator/scaffold.ts:1
  • packages/create-agent-harness/src/diag.ts has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/create-agent-harness/src/diag.ts:1
  • packages/create-agent-harness/src/score.ts has 441 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/create-agent-harness/src/score.ts:1
  • packages/kernel-js/src/memory-rvf.ts has 429 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/kernel-js/src/memory-rvf.ts:1
  • packages/arc-agi-3/src/belief-graph.ts has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/arc-agi-3/src/belief-graph.ts:1
  • REDACTED has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • packages/agntcy/src/oasf/publish.ts has 404 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — packages/agntcy/src/oasf/publish.ts:1

What to do

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

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

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

  • packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152 imports './fixtures/rvf-0.4.6', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152
  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×36) — packages/create-agent-harness/templates/catalog.def.mjs:1, packages/create-agent-harness/scripts/gen-templates.mjs:1, experiments/router-calibration-loop/lib.mjs:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness8.0 / 10Strong✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

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

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

  • This repository declares test tooling, and the ✓ above records that declaration — but packages/kernel-js/__tests__/memory-rvf-metadata.test.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152
R7 · Dead Code8.3 / 10Strong✓ Tool-verified

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

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

  • Unreachable from the 449 application, 123 tooling and 461 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/darwin-mode/bench/ruvector/h3-code-localize.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — packages/darwin-mode/bench/ruvector/h3-code-gate.mjs
  • no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (experiments/router-calibration-loop/assert.mjs, experiments/router-calibration-loop/run.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — experiments/router-calibration-loop/lib.mjs
  • no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×18) — packages/darwin-mode/bench/livecodebench/solve-lcb.mjs, packages/darwin-mode/bench/ruvector/h3-code-localize.mjs, packages/darwin-mode/bench/translate/chunked-synthesis.mjs, …
  • no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (experiments/signal-flywheel/run.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — experiments/signal-flywheel/config.mjs
  • This script imports the product ('../dist/index.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/aws-finops/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/aws-finops/bench/real-oracle.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it. — packages/aws-finops/bench/real-oracle.mjs
  • This script imports the product ('../dist/index.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/projects/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/projects/bench/real-cve-corpus.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it. — packages/projects/bench/real-cve-corpus.mjs
  • This script imports the product ('../dist/memory-rvf.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/kernel-js/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/kernel-js/bench/memory-rvf-bench.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it. — packages/kernel-js/bench/memory-rvf-bench.mjs
  • Nothing imports this binding — it is safe to review for removal. (×13) — kimi-k3-harness/scripts/kernel.mjs:9, packages/create-agent-harness/src/analyze-repo.ts:358, packages/darwin-mode/bench/cognition/cognition-harness.mjs:31, …
  • Nothing ultimately consumes this binding: its only referrer is the re-export in packages/arc-agi-3-bench/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/arc-agi-3-bench/src/index.ts in the same commit, or the barrel will import a name that no longer exists. (×2) — packages/arc-agi-3-bench/src/canonical.ts:46, packages/arc-agi-3-bench/src/types.ts:275

What to do

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

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

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

  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. (×2) — scripts/generated-journey.mjs:9, packages/create-agent-harness/__tests__/generated-journey.test.ts:8
  • Declared in packages/create-agent-harness/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — packages/create-agent-harness/package.json:69
  • Declared in services/apicompletions/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — services/apicompletions/package.json:21

What to do

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

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

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

  • packages/create-agent-harness/src/meta-proxy-service.ts → REDACTED → packages/create-agent-harness/src/meta-proxy-service.ts — packages/create-agent-harness/src/meta-proxy-service.ts:29
  • packages/create-agent-harness/src/subcommands.ts → packages/create-agent-harness/src/validate.ts → packages/create-agent-harness/src/subcommands.ts — packages/create-agent-harness/src/subcommands.ts:18
  • packages/router/src/index.ts → packages/router/src/train.ts → packages/router/src/index.ts — packages/router/src/index.ts:195

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document1.7 / 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.

  • `canon` is exported and takes `v: unknown` from its caller, and it calls itself at line 15 (`canon`) with a piece of `v` (and at line 17) — and nowhere in `canon` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canon` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/turn-credit/src/receipt.ts:15
  • `stableStringify` is exported and takes `value: unknown` from its caller, and it calls itself at line 102 (`stableStringify`) with a piece of `value` (and at line 105) — and nowhere in `stableStringify` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `stableStringify` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/projects/src/core.ts:102
  • `validate` is exported and takes `v: unknown` from its caller, and it calls itself at line 40 (`validate`) with a piece of `v` (and at line 56) — and nowhere in `validate` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `validate` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/oo-agents/src/schema.ts:40
  • `describe` is exported and takes `s: Schema` from its caller, and it calls itself at line 82 (`describe`) with a piece of `s` (and at line 85) — and nowhere in `describe` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `describe` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/oo-agents/src/schema.ts:82
  • `to_json` is public and takes `v: &Value` from its caller, and it calls itself at line 97 with a piece of the document (and at line 109) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_json` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/oo-agents/crate/src/lib.rs:97
  • `canonicalJson` is exported and takes `v: unknown` from its caller, and it calls itself at line 59 (`canonicalJson`) with a piece of `v` (and at line 64) — and nowhere in `canonicalJson` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/kernel-js/src/session.ts:59
  • `to_json` is public and takes `v: &Value` from its caller, and it calls itself at line 119 with a piece of the document (and at line 131) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_json` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/horizon/crate/src/lib.rs:119
  • `canonical` is exported, takes a document from its caller (line 16) and hands it to `sortKeys`, which calls itself at line 21 (`sortKeys`) with a piece of `value` (and at line 25) — and nowhere in `sortKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `sortKeys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/harness/src/receipts.ts:21
  • `evidenceDigest` is exported, takes a document from its caller (line 66) and hands it to `visit`, which calls itself at line 74 (`visit`) with a piece of `v` (and at line 79) — and nowhere in `visit` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/flywheel/src/production-gate.ts:74
  • `canonicalJson` is exported and takes `value: unknown` from its caller, and it calls itself at line 144 (`canonicalJson`) with a piece of `value` (and at line 148) — and nowhere in `canonicalJson` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/field-memory/src/util.ts:144
  • `redactSecretsDeep` is exported and takes `value: unknown` from its caller, and it calls itself at line 57 (`redactSecretsDeep`) with a piece of `value` (and at line 61) — and nowhere in `redactSecretsDeep` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `redactSecretsDeep` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/create-agent-harness/src/redact.ts:57
  • `parsePolicyReport` is exported, takes a document from its caller (line 34) and hands it to `collect`, which calls itself at line 17 (`collect`) with a piece of `node` — and nowhere in `collect` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `collect` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/aws-finops/src/checkov-adapter.ts:17
  • `canonical` is exported and takes `value: unknown` from its caller, and it calls itself at line 10 (`canonical`) with a piece of `value` (and at line 15) — and nowhere in `canonical` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonical` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/avo/src/crypto.ts:10
  • `canon` is exported and takes `v: unknown` from its caller, and it calls itself at line 31 (`canon`) with a piece of `v` (and at line 33) — and nowhere in `canon` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canon` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/avo/src/flywheelGate.ts:31
  • `assertNoHiddenGameIdentity` is exported, takes a document from its caller (line 150) and hands it to `visit`, which calls itself at line 157 (`visit`) with a piece of `candidate` (and at line 165) — and nowhere in `visit` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/arc-agi-3-chatgpt/src/types.ts:157
  • `canonicalJson` is exported, takes a document from its caller (line 34) and hands it to `canonicalize`, which calls itself at line 20 (`canonicalize`) with a piece of `value` (and at line 27) — and nowhere in `canonicalize` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalize` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/arc-agi-3-bench/src/canonical.ts:20
  • `get` is public and takes a `J` as its receiver from its caller, and it calls itself at line 20 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `get` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — kimi-k3-harness/crates/k3rs/src/json.rs:20
  • `to_canonical_json` is public and takes `value: &serde_json::Value` from its caller, and it calls itself at line 215 with a piece of the document (and at line 221) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_canonical_json` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/kernel/src/session.rs:215

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.
X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation6.3 / 10Adequate✓ Tool-verified

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

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

  • Only 5/13 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `complete` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — services/apicompletions/src/providers/openrouter.ts:29
  • `invoke` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — packages/redblue/src/attacks/sandbox.ts:37
  • `loadGsm8kFromHub` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — packages/evals-math/src/data.ts:114
  • `generateMutation` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. (×2) — packages/darwin-mode/src/openrouter-mutator.ts:66, packages/darwin-mode/src/requesty-mutator.ts:58
  • `pinJson` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — packages/create-agent-harness/src/publish.ts:44
  • `fetchRepoFiles` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — apps/web-ui/src/components/RepoImporter.tsx:20
  • `waitForServer` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — apps/web-ui/scripts/screenshot.mjs:21

What to do

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

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

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

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

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

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

X25 · Inert configuration knob6.7 / 10Strong✓ Tool-verified

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.

  • `CodeqlDetectorOracle` accepts `opts.timeoutMs` from the caller and keeps it in `this.timeoutMs` on line 65, where only it can read the value — but nothing ever reads `this.timeoutMs`. Setting `opts.timeoutMs` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `this.timeoutMs` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `opts.timeoutMs` from the accepted options so callers stop setting a knob that does nothing. — packages/darwin-mode/src/security/codeql-oracle.ts:65
  • `HandlerOutput.decision` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/kernel/src/hooks.rs:89
  • `HandlerOutput.additional_context` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/kernel/src/hooks.rs:90
  • `HandlerOutput.updated_input` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/kernel/src/hooks.rs:91
  • `AgentMeta.role` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:27
  • `ItemMeta.description` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:35
  • `TemplateMeta.dir` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:43
  • `TemplateMeta.domain` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:46
  • `TemplateMeta.description` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:47
  • `TemplateMeta.harness_desc` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:48
  • `TemplateMeta.quick_start` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:49
  • `TemplateMeta.tags` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:50
  • `TemplateMeta.mcp_servers` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:52
  • `TemplateMeta.agent_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:53
  • `TemplateMeta.skill_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:54
  • `TemplateMeta.command_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:55
  • `TemplateMeta.agents` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:56
  • `TemplateMeta.skills` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:57
  • `TemplateMeta.commands` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/template-catalog/src/lib.rs:58

What to do

  • Each finding names the spans that disagree — the knob the caller supplies and the site that ignores it, whether by re-spelling its default, by falling back under the wrong key, by parsing with no format provider at all, or by printing under whatever culture the host supplies. Confirm from those spans, then decide which of the two the type meant: read the knob at the named site, or drop the knob so the signature stops advertising something the type cannot feel. Leaving both is the one option that cannot be right.
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.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

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

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

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

  • 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. (×33) — packages/jujutsu/src/capability.ts:71, packages/jujutsu/src/capability.ts:95, packages/jujutsu/src/bridge/adapters/agentic-jujutsu-op-provider.ts:79, …
  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. (×7) — packages/darwin-mode/src/archive.ts:52, packages/darwin-mode/src/archive.ts:59, packages/darwin-mode/src/mutator.ts:278, …

What to do

  • Swallowed exception (empty catch)
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.

X4 · Structured logging10.0 / 10Exemplary○ Nothing flagged

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.

X5 · Nullable reference types8.9 / 10Exemplary✓ Tool-verified

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

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

  • ~2.8 `!` null assertions per 1k TypeScript source lines — 257 assertion(s) across the 91884 source line(s) of the 491 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/arc-agi-3/src/plan-archive.ts (21), packages/arc-agi-3/src/receipts.ts (10), packages/create-agent-harness/src/index.ts (10). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.

What to do

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

WCAG coverage — what static analysis assessed

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

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

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

Reference — by lens

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

LensScoreRatingImpact
Code Health63.2Adequate — gated by D1, D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture72.1StrongSolid.
Maturity96.2ExemplarySolid.
Readiness51.3Adequate — gated by D13, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security71.1Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Event Sourcing100.0ExemplaryStrongest area.
Accessibility37.3Weak — gated by AC1, AC4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance72.9StrongSolid.
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.

  • SC1 Supply-chain hygiene — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 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: these audit 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 audit 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.
  • C4 Data Retention — Not assessed: these retention 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 retention 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.
  • C5 Data-Subject Rights — Not assessed: these data-subject rights 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 data-subject rights 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.
Not included — 36 check(s) not relevant to this codebase

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

  • AX1 Captive dependencies — not 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
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — The runtime tier booted this repository's service, but crawled PUBLIC routes only — add a Playwright storageState (e.g. playwright/.auth/user.json) or a test auth-setup to crawl authenticated screens rendered 0/1 surface(s) × 2 renders render failed for http://127.0.0.1:32768: page.addStyleTag: Refused to apply inline style because it violates the following Content Security Policy directive: "default-src 'none'". Either the 'unsafe-in ran the repo's playwright suite against the booted app but captured no surfaces (suite failed to install/run, or visited no pages) — see runtime diagnostics. This repository also has a user interface (15 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates) that the booted service does not serve, and this scan has no strategy that reaches it — so no WCAG success criterion was verified in a rendered page on this run. That is a gap in OUR tooling, not a finding about your application: nothing here says the interface is inaccessible. The static accessibility checks still ran.
  • AXS1 Runtime exposed surface — 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 — Not assessed: these authorization 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 authorization 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.
  • D12 Dependency Hygiene — Not scored — 14 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D32 Data Compliance (PII/GDPR) — 13 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • 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.
  • D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 8 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • 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.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — X27 reached only 10% of this repository's production lines — typescript (88,845 lines), javascript (41,350 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 43 finding(s)
D13 · Secret Scanning · Leaked secret · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D11 · Test Reliability · Flaky test · ×3
  • Flaky test: the repository rootpackages/darwin-mode/__tests__/security/real-loop.test.ts::real semgrep as the in-loop judge does NOT promote a candidate equal to the incumbent (no improvement) — Passed 2×, failed 1× across repeated runs.
  • Flaky test: the repository rootpackages/darwin-mode/__tests__/security/real-loop.test.ts::real semgrep as the in-loop judge promotes a broader rule over a narrower incumbent (statistically, zero FP) — Passed 2×, failed 1× across repeated runs.
  • Flaky test: the repository rootpackages/darwin-mode/__tests__/security/semgrep-oracle.test.ts::real semgrep on the labeled fixture is reproducible across runs (deterministic findings for a fixed version) — Passed 2×, failed 1× across repeated runs.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R9 · Circular Imports · Import cycle (2 files) · ×3
  • Import cycle (2 files) packages/create-agent-harness/src/meta-proxy-service.ts:29 — packages/create-agent-harness/src/meta-proxy-service.ts → REDACTED → packages/create-agent-harness/src/meta-proxy-service.ts
  • Import cycle (2 files) packages/create-agent-harness/src/subcommands.ts:18 — packages/create-agent-harness/src/subcommands.ts → packages/create-agent-harness/src/validate.ts → packages/create-agent-harness/src/subcommands.ts
  • Import cycle (2 files) packages/router/src/index.ts:195 — packages/router/src/index.ts → packages/router/src/train.ts → packages/router/src/index.ts
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×2
  • REDACTED
  • REDACTED
R8 · Dependency Hygiene · Unlisted import '@modelcontextprotocol/sdk' · ×2
  • Unlisted import '@modelcontextprotocol/sdk' scripts/generated-journey.mjs:9 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
  • Unlisted import '@modelcontextprotocol/sdk' packages/create-agent-harness/__tests__/generated-journey.test.ts:8 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
AC2 · Forms & labels · <label> that labels no control · ×1
  • <label> that labels no control apps/web-ui/public/cost-pareto.html:270 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC2 · Forms & labels · <input> without a programmatic label · ×1
  • <input> without a programmatic label apps/web-ui/public/cost-pareto.html:271 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC3 · Page structure · Document without a <title> · ×1
  • Document without a <title> REDACTED:2 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
AC4 · Keyboard semantics · Click handler on a <span> nested inside <button> · ×1
  • Click handler on a <span> nested inside <button> apps/web-ui/src/components/CatalogPicker.tsx:62 — This <span> carries its own click handler, but it sits inside a <button> that performs a different action. A keyboard user reaches the <button> and activating it runs the <button>'s handler, never this one, so this action has no keyboard path at all. Role and tabindex cannot supply one: HTML forbids a <button> from containing interactive content or any descendant with a tabindex, so the browser will not put this element in the tab order however it is marked up. Move it out of the <button> and make it a sibling <button>, so each action has its own control.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 979 finding(s)
PF3 · Async & latency hygiene · Sync-over-async blocking · ×40
  • Sync-over-async blocking packages/avo/src/cli.ts:52 — `writeFileSync` in `dispatch` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/avo/src/cli.ts:68 — `readFileSync` in `dispatch` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/avo/src/memory.ts:66 — `existsSync` in `create` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/avo/src/repository.ts:52 — `existsSync` in `fork` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/analyze-repo.ts:382 — `existsSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/analyze-repo.ts:382 — `statSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/analyze-repo.ts:395 — `writeFileSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/analyze-repo.ts:396 — `writeFileSync` in `analyzeRepoCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/audit-cmd.ts:44 — `existsSync` in `auditCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/audit-cmd.ts:55 — `existsSync` in `auditCmd` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/compare-cmd.ts:68 — `existsSync` in `readManifest` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:212 — `existsSync` in `buildDiagReport` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:413 — `existsSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:415 — `readFileSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:434 — `existsSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:436 — `readFileSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:443 — `existsSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/diag.ts:445 — `readdirSync` in `buildSupportBundle` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:70 — `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:78 — `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:83 — `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:87 — `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:90 — `existsSync` in `planEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/eject.ts:135 — `existsSync` in `applyEject` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking packages/create-agent-harness/src/export-config.ts:53 — `existsSync` in `buildExportedConfig` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • + 15 more in this group — see findings.md.
R11 · Import Boundaries · Boundary violation [package · ×40
  • Boundary violation [package:test-cross-package-internals] __tests__/cli-flags-completions.test.ts:4 — __tests__/cli-flags-completions.test.ts:4 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/dream-explicit-new.test.ts:2 — __tests__/dream-explicit-new.test.ts:2 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/dream-explicit-new.test.ts:13 — __tests__/dream-explicit-new.test.ts:13 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/dream-explicit-new.test.ts:14 — __tests__/dream-explicit-new.test.ts:14 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/dream-explicit-new.test.ts:30 — __tests__/dream-explicit-new.test.ts:30 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:34 — __tests__/e2e-lifecycle.test.ts:34 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:35 — __tests__/e2e-lifecycle.test.ts:35 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:36 — __tests__/e2e-lifecycle.test.ts:36 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:37 — __tests__/e2e-lifecycle.test.ts:37 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:38 — __tests__/e2e-lifecycle.test.ts:38 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:39 — __tests__/e2e-lifecycle.test.ts:39 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:40 — __tests__/e2e-lifecycle.test.ts:40 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:41 — __tests__/e2e-lifecycle.test.ts:41 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:42 — __tests__/e2e-lifecycle.test.ts:42 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/federate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-lifecycle.test.ts:43 — __tests__/e2e-lifecycle.test.ts:43 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/diag.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-scaffold-validate.test.ts:19 — __tests__/e2e-scaffold-validate.test.ts:19 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-scaffold-validate.test.ts:20 — __tests__/e2e-scaffold-validate.test.ts:20 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/e2e-scaffold-validate.test.ts:97 — __tests__/e2e-scaffold-validate.test.ts:97 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/harness-sbom-audit.test.ts:7 — __tests__/harness-sbom-audit.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/harness-sbom-audit.test.ts:8 — __tests__/harness-sbom-audit.test.ts:8 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/mcp-cmd.test.ts:7 — __tests__/mcp-cmd.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/mcp-dispatch-integration.test.ts:15 — __tests__/mcp-dispatch-integration.test.ts:15 reaches past another workspace package's public entry into its internals with a relative path (../packages/kernel-js/src/dispatch.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/publish-cmd.test.ts:7 — __tests__/publish-cmd.test.ts:7 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/upgrade-cmd.test.ts:8 — __tests__/upgrade-cmd.test.ts:8 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • Boundary violation [package:test-cross-package-internals] __tests__/upgrade-cmd.test.ts:9 — __tests__/upgrade-cmd.test.ts:9 reaches past another workspace package's public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) — the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead.
  • + 15 more in this group — see findings.md.
R4 · Test Coverage · No test reaches this file · ×36
  • No test reaches this file packages/create-agent-harness/templates/catalog.def.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/create-agent-harness/scripts/gen-templates.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/router-calibration-loop/lib.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/turn-credit-acceptance/lib.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/signal-flywheel/config.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/user-awareness/probe.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/radio/scripts/flywheel-radio.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/credit-feedback/lib.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/weight-eft/src/types.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file services/apicompletions/src/budget/firestore.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/signal-flywheel/run.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file kimi-k3-harness/scripts/flywheel-evolve.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/agntcy/scripts/generate-oasf-taxonomy.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/user-awareness/models.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file apps/web-ui/scripts/screenshot.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/horizon/scripts/demo.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file apps/web-ui/scripts/make-og.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/router-calibration-loop/run.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file services/apicompletions/src/firestore/client.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/turn-credit-acceptance/run.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/router-calibration-loop/assert.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/credit-feedback/assert.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/turn-credit-acceptance/assert.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file packages/flywheel/scripts/reproduce-production-controls.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file experiments/signal-flywheel/verify.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • + 11 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×35
  • FunctionTooLong: official-factory.createOfficialArcControllerFactory packages/arc-agi-3-chatgpt/src/official-factory.ts:624 — FunctionTooLong — createOfficialArcControllerFactory runs 508 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 408 over it, 5.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: HarnessBuilder.HarnessBuilder apps/web-ui/src/components/HarnessBuilder.tsx:47 — FunctionTooLong — HarnessBuilder runs 321 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 221 over it, 3.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: sim.runSim packages/radio/src/sim.ts:451 — FunctionTooLong — runSim runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: field-memory.parseRecord packages/field-memory/src/field-memory.ts:450 — FunctionTooLong — parseRecord runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: evolve.evolve packages/darwin-mode/src/evolve.ts:311 — FunctionTooLong — evolve runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: tools.registerActorTools packages/arc-agi-3-chatgpt/src/tools.ts:320 — FunctionTooLong — registerActorTools runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: checkpoint.validateSupervisorState packages/arc-agi-3/src/checkpoint.ts:476 — FunctionTooLong — validateSupervisorState runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: RepoImporter.RepoImporter apps/web-ui/src/components/RepoImporter.tsx:44 — FunctionTooLong — RepoImporter runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: server.createArcMcpRuntime REDACTED:358 — FunctionTooLong — createArcMcpRuntime runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: meta-proxy-service.enableMetaProxyService packages/create-agent-harness/src/meta-proxy-service.ts:392 — FunctionTooLong — enableMetaProxyService runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: production-run.runProductionFlywheel packages/flywheel/src/production-run.ts:12 — FunctionTooLong — runProductionFlywheel runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: OnboardingModal.OnboardingModal apps/web-ui/src/components/OnboardingModal.tsx:113 — FunctionTooLong — OnboardingModal runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: numeric-evolve.evolveNumeric packages/darwin-mode/src/numeric-evolve.ts:57 — FunctionTooLong — evolveNumeric runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: engine.runContrastive packages/darwin-mode/src/contrastive/engine.ts:14 — FunctionTooLong — runContrastive runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: run.runFlywheelGenerations packages/flywheel/src/run.ts:91 — FunctionTooLong — runFlywheelGenerations runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: memory-rvf.createRvfBackend packages/kernel-js/src/memory-rvf.ts:297 — FunctionTooLong — createRvfBackend runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: runner.runEpisode packages/arc-agi-3-bench/src/runner.ts:80 — FunctionTooLong — runEpisode runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: h1-submit.gatedSubmit packages/redblue/src/integrations/h1-submit.ts:160 — FunctionTooLong — gatedSubmit runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: audit-cmd.auditCmd packages/create-agent-harness/src/audit-cmd.ts:20 — FunctionTooLong — auditCmd runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: blue.basePatchFor packages/redblue/src/actors/blue.ts:30 — FunctionTooLong — basePatchFor runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: host-config.hostConfigFiles packages/create-agent-harness/src/host-config.ts:109 — FunctionTooLong — hostConfigFiles runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: multigeneration-proof.verifyMultiGenerationEvidence packages/flywheel/src/multigeneration-proof.ts:276 — FunctionTooLong — verifyMultiGenerationEvidence runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: scaffold.hostFiles apps/web-ui/src/generator/scaffold.ts:275 — FunctionTooLong — hostFiles runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: poker_darwin::darwin::evolve crates/poker-darwin/src/darwin.rs:426 — FunctionTooLong — poker_darwin::darwin::evolve runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: safety-ast.analyzeSurfaceSource packages/darwin-mode/src/safety-ast.ts:155 — FunctionTooLong — analyzeSurfaceSource runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • + 10 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (empty catch) · ×33
  • Swallowed exception (empty catch) packages/jujutsu/src/capability.ts:71 — 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) packages/jujutsu/src/capability.ts:95 — 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) packages/jujutsu/src/bridge/adapters/agentic-jujutsu-op-provider.ts:79 — 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) packages/jujutsu/src/bridge/adapters/agenticow-memory-provider.ts:141 — 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) packages/jujutsu/src/bridge/adapters/agenticow-memory-provider.ts:147 — 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) packages/horizon/src/executor.ts:142 — 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) packages/flywheel/src/replay.ts:106 — 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) packages/flywheel/src/run.ts:270 — 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) packages/evals-toolcall/src/normalizer.ts:59 — 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) packages/darwin-mode/src/tier2-driver.ts:58 — 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) packages/darwin-mode/src/tier2-driver.ts:96 — 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) packages/darwin-mode/src/gepa/metric.ts:36 — 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) packages/create-agent-harness/src/analyze-repo.ts:129 — 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) packages/create-agent-harness/src/analyze-repo.ts:148 — 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) packages/create-agent-harness/src/analyze-repo.ts:182 — 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) packages/create-agent-harness/src/audit-cmd.ts:85 — 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) packages/create-agent-harness/src/audit-cmd.ts:158 — 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) packages/create-agent-harness/src/diag.ts:175 — 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) packages/create-agent-harness/src/diag.ts:221 — 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) packages/create-agent-harness/src/diag.ts:427 — 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) packages/create-agent-harness/src/diag.ts:448 — 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) packages/create-agent-harness/src/export-config.ts:67 — 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) packages/create-agent-harness/src/export-config.ts:89 — 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) packages/create-agent-harness/src/export-config.ts:105 — 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) packages/create-agent-harness/src/index.ts:58 — 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 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×18
  • FileTooLong: src/controller.ts packages/arc-agi-3/src/controller.ts — FileTooLong — 1155 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: ArcController (281-1500). The bar is 500 significant lines; this is 655 over it, 2.31× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/store.ts packages/arc-agi-3-chatgpt/src/store.ts — FileTooLong — 1032 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: ArcEpisodeStore (216-1322). The bar is 500 significant lines; this is 532 over it, 2.06× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/field-memory.ts packages/field-memory/src/field-memory.ts — FileTooLong — 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/official-factory.ts packages/arc-agi-3-chatgpt/src/official-factory.ts — FileTooLong — 987 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 487 over it, 1.97× 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: src/checkpoint.ts packages/arc-agi-3/src/checkpoint.ts — FileTooLong — 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79× 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: src/plan-archive.ts packages/arc-agi-3/src/plan-archive.ts — FileTooLong — 831 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: ArcPlanArchive (364-1060). The bar is 500 significant lines; this is 331 over it, 1.66× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/index.ts packages/create-agent-harness/src/index.ts — FileTooLong — 732 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 232 over it, 1.46× 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: python/bridge.py packages/arc-agi-3/python/bridge.py — FileTooLong — 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 over it, 1.37× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/python-bridge.ts packages/arc-agi-3/src/python-bridge.ts — FileTooLong — 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 over it, 1.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: src/avo-loop.ts packages/arc-agi-3/src/avo-loop.ts — FileTooLong — 642 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: ArcAvoLoop (123-836). The bar is 500 significant lines; this is 142 over it, 1.28× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/canonical.ts packages/arc-agi-3/src/canonical.ts — 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: REDACTED REDACTED — FileTooLong — 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24× 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: src/lib.rs packages/horizon/crate/src/lib.rs — FileTooLong — 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 118 over it, 1.24× 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: src/tools.ts packages/arc-agi-3-chatgpt/src/tools.ts — FileTooLong — 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/claim-gate.ts packages/avo/src/claim-gate.ts — FileTooLong — 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/meta-proxy-service.ts packages/create-agent-harness/src/meta-proxy-service.ts — FileTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 over it, 1.15× 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: src/model.rs kimi-k3-harness/crates/k3rs/src/model.rs — FileTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). 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.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×18
  • Recursive walk over a caller-supplied document has no depth cap packages/turn-credit/src/receipt.ts:15 — `canon` is exported and takes `v: unknown` from its caller, and it calls itself at line 15 (`canon`) with a piece of `v` (and at line 17) — and nowhere in `canon` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canon` 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 packages/projects/src/core.ts:102 — `stableStringify` is exported and takes `value: unknown` from its caller, and it calls itself at line 102 (`stableStringify`) with a piece of `value` (and at line 105) — and nowhere in `stableStringify` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `stableStringify` 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 packages/oo-agents/src/schema.ts:40 — `validate` is exported and takes `v: unknown` from its caller, and it calls itself at line 40 (`validate`) with a piece of `v` (and at line 56) — and nowhere in `validate` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `validate` 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 packages/oo-agents/src/schema.ts:82 — `describe` is exported and takes `s: Schema` from its caller, and it calls itself at line 82 (`describe`) with a piece of `s` (and at line 85) — and nowhere in `describe` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `describe` 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 packages/oo-agents/crate/src/lib.rs:97 — `to_json` is public and takes `v: &Value` from its caller, and it calls itself at line 97 with a piece of the document (and at line 109) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_json` 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 packages/kernel-js/src/session.ts:59 — `canonicalJson` is exported and takes `v: unknown` from its caller, and it calls itself at line 59 (`canonicalJson`) with a piece of `v` (and at line 64) — and nowhere in `canonicalJson` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalJson` 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 packages/horizon/crate/src/lib.rs:119 — `to_json` is public and takes `v: &Value` from its caller, and it calls itself at line 119 with a piece of the document (and at line 131) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_json` 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 packages/harness/src/receipts.ts:21 — `canonical` is exported, takes a document from its caller (line 16) and hands it to `sortKeys`, which calls itself at line 21 (`sortKeys`) with a piece of `value` (and at line 25) — and nowhere in `sortKeys` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `sortKeys` 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 packages/flywheel/src/production-gate.ts:74 — `evidenceDigest` is exported, takes a document from its caller (line 66) and hands it to `visit`, which calls itself at line 74 (`visit`) with a piece of `v` (and at line 79) — and nowhere in `visit` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `visit` 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 packages/field-memory/src/util.ts:144 — `canonicalJson` is exported and takes `value: unknown` from its caller, and it calls itself at line 144 (`canonicalJson`) with a piece of `value` (and at line 148) — and nowhere in `canonicalJson` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalJson` 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 packages/create-agent-harness/src/redact.ts:57 — `redactSecretsDeep` is exported and takes `value: unknown` from its caller, and it calls itself at line 57 (`redactSecretsDeep`) with a piece of `value` (and at line 61) — and nowhere in `redactSecretsDeep` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `redactSecretsDeep` 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 packages/aws-finops/src/checkov-adapter.ts:17 — `parsePolicyReport` is exported, takes a document from its caller (line 34) and hands it to `collect`, which calls itself at line 17 (`collect`) with a piece of `node` — and nowhere in `collect` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `collect` 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 packages/avo/src/crypto.ts:10 — `canonical` is exported and takes `value: unknown` from its caller, and it calls itself at line 10 (`canonical`) with a piece of `value` (and at line 15) — and nowhere in `canonical` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonical` 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 packages/avo/src/flywheelGate.ts:31 — `canon` is exported and takes `v: unknown` from its caller, and it calls itself at line 31 (`canon`) with a piece of `v` (and at line 33) — and nowhere in `canon` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canon` 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 packages/arc-agi-3-chatgpt/src/types.ts:157 — `assertNoHiddenGameIdentity` is exported, takes a document from its caller (line 150) and hands it to `visit`, which calls itself at line 157 (`visit`) with a piece of `candidate` (and at line 165) — and nowhere in `visit` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `visit` 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 packages/arc-agi-3-bench/src/canonical.ts:20 — `canonicalJson` is exported, takes a document from its caller (line 34) and hands it to `canonicalize`, which calls itself at line 20 (`canonicalize`) with a piece of `value` (and at line 27) — and nowhere in `canonicalize` 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. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `canonicalize` 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 kimi-k3-harness/crates/k3rs/src/json.rs:20 — `get` is public and takes a `J` as its receiver from its caller, and it calls itself at line 20 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `get` 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 crates/kernel/src/session.rs:215 — `to_canonical_json` is public and takes `value: &serde_json::Value` from its caller, and it calls itself at line 215 with a piece of the document (and at line 221) — and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `to_canonical_json` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
X25 · Inert configuration knob · Configuration option is read nowhere · ×18
  • Configuration option is read nowhere crates/kernel/src/hooks.rs:89 — `HandlerOutput.decision` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/kernel/src/hooks.rs:90 — `HandlerOutput.additional_context` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/kernel/src/hooks.rs:91 — `HandlerOutput.updated_input` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:27 — `AgentMeta.role` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:35 — `ItemMeta.description` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:43 — `TemplateMeta.dir` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:46 — `TemplateMeta.domain` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:47 — `TemplateMeta.description` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:48 — `TemplateMeta.harness_desc` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:49 — `TemplateMeta.quick_start` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:50 — `TemplateMeta.tags` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:52 — `TemplateMeta.mcp_servers` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:53 — `TemplateMeta.agent_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:54 — `TemplateMeta.skill_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:55 — `TemplateMeta.command_count` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:56 — `TemplateMeta.agents` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:57 — `TemplateMeta.skills` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere crates/template-catalog/src/lib.rs:58 — `TemplateMeta.commands` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
D15 · Churn × Complexity Hotspots · Hotspot · ×15
  • Hotspot: packages/create-agent-harness/src/index.ts packages/create-agent-harness/src/index.ts:681 — packages/create-agent-harness/src/index.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in index.renderScaffold at line 681. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/index.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/flywheel/src/replay.ts packages/flywheel/src/replay.ts:96 — packages/flywheel/src/replay.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in replay.verifyReplayBundle at line 96. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/flywheel/src/replay.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:421 — REDACTED changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in GovernedVariationOperator.run at line 421. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/flywheel/src/run.ts packages/flywheel/src/run.ts:91 — packages/flywheel/src/run.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in run.runFlywheelGenerations at line 91. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/flywheel/src/run.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/subcommands.ts packages/create-agent-harness/src/subcommands.ts:84 — packages/create-agent-harness/src/subcommands.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in subcommands.doctor at line 84. 3 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/subcommands.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/darwin-mode/src/cli.ts packages/darwin-mode/src/cli.ts:286 — packages/darwin-mode/src/cli.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in cli.main at line 286. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/darwin-mode/src/cli.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/flywheel/src/multigeneration-proof.ts packages/flywheel/src/multigeneration-proof.ts:276 — packages/flywheel/src/multigeneration-proof.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in multigeneration-proof.verifyMultiGenerationEvidence at line 276. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/flywheel/src/multigeneration-proof.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:48 — REDACTED changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mcp-scan.scanMcp at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/redblue/src/mock-target.ts packages/redblue/src/mock-target.ts:47 — packages/redblue/src/mock-target.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in mock-target.exampleAgentTarget at line 47. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/redblue/src/mock-target.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/host-config.ts packages/create-agent-harness/src/host-config.ts:109 — packages/create-agent-harness/src/host-config.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in host-config.hostConfigFiles at line 109. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/host-config.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: apps/web-ui/src/generator/scaffold.ts apps/web-ui/src/generator/scaffold.ts:275 — apps/web-ui/src/generator/scaffold.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in scaffold.hostFiles at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- apps/web-ui/src/generator/scaffold.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/upgrade-cmd.ts packages/create-agent-harness/src/upgrade-cmd.ts:45 — packages/create-agent-harness/src/upgrade-cmd.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in upgrade-cmd.upgradeCmd at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/upgrade-cmd.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/repo-scorecard.ts packages/create-agent-harness/src/repo-scorecard.ts:52 — packages/create-agent-harness/src/repo-scorecard.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in repo-scorecard.buildRepoScorecard at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/repo-scorecard.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/threat-model.ts packages/create-agent-harness/src/threat-model.ts:62 — packages/create-agent-harness/src/threat-model.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in threat-model.buildThreatModel at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/threat-model.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: packages/create-agent-harness/src/analyze-repo.ts packages/create-agent-harness/src/analyze-repo.ts:162 — packages/create-agent-harness/src/analyze-repo.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in analyze-repo.analyzeFiles at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- packages/create-agent-harness/src/analyze-repo.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D5 · Coupling · Off the main sequence · ×10
  • Off the main sequence: @metaharness/turn-credit — @metaharness/turn-credit: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/vertical-base — @metaharness/vertical-base: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/workspace-lens — @metaharness/workspace-lens: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/darwin — @metaharness/darwin: abstractness 0.09, instability 0.00, distance 0.91 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/weight-eft — @metaharness/weight-eft: abstractness 0.14, instability 0.00, distance 0.86 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/flywheel — @metaharness/flywheel: abstractness 0.17, instability 0.00, distance 0.83 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/redblue — @metaharness/redblue: abstractness 0.19, instability 0.00, distance 0.81 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/radio — @metaharness/radio: abstractness 0.20, instability 0.00, distance 0.80 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/horizon — @metaharness/horizon: abstractness 0.23, instability 0.00, distance 0.77 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: @metaharness/harness — @metaharness/harness: abstractness 0.25, instability 0.00, distance 0.75 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
D2 · Cognitive Complexity · k3rs · ×9
  • k3rs::json::value (cognitive 56) kimi-k3-harness/crates/k3rs/src/json.rs:76 — k3rs::json::value has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 6 (17 pts), loops 5 (13 pts), boolean chains 5 (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.
  • k3rs::model::kda_layer (cognitive 38) kimi-k3-harness/crates/k3rs/src/model.rs:436 — k3rs::model::kda_layer has cognitive complexity 38 (threshold 15). Drivers by points: loops 16 (35 pts), if/else 2, boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::model::mla_layer (cognitive 34) kimi-k3-harness/crates/k3rs/src/model.rs:356 — k3rs::model::mla_layer has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 2 (6 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::model::decoder_layer (cognitive 25) kimi-k3-harness/crates/k3rs/src/model.rs:649 — k3rs::model::decoder_layer has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 8 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::ops::matmul_mxfp4 (cognitive 25) kimi-k3-harness/crates/k3rs/src/ops.rs:433 — k3rs::ops::matmul_mxfp4 has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 3 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::ops::shortconv (cognitive 22) kimi-k3-harness/crates/k3rs/src/ops.rs:178 — k3rs::ops::shortconv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (9 pts), match/switch 1 (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.
  • k3rs::main (cognitive 21) kimi-k3-harness/crates/k3rs/src/main.rs:19 — k3rs::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • k3rs::ops::kda_step_scratch (cognitive 18) kimi-k3-harness/crates/k3rs/src/ops.rs:262 — k3rs::ops::kda_step_scratch has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (6 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::ops::router (cognitive 18) kimi-k3-harness/crates/k3rs/src/ops.rs:313 — k3rs::ops::router has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D3 · God Classes · MethodTooLong · ×9
  • MethodTooLong: ArcPlanArchive.load packages/arc-agi-3/src/plan-archive.ts:793 — MethodTooLong — load runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: GovernedVariationOperator.run REDACTED:421 — MethodTooLong — run runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: FieldMemory.update packages/field-memory/src/field-memory.ts:788 — MethodTooLong — update runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ArcController.actCriticalSection packages/arc-agi-3/src/controller.ts:904 — MethodTooLong — actCriticalSection runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ArcPlanArchive.addCandidates packages/arc-agi-3/src/plan-archive.ts:390 — MethodTooLong — addCandidates runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ArcAvoLoop.#stepCritical packages/arc-agi-3/src/avo-loop.ts:338 — MethodTooLong — #stepCritical runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: FieldMemory.choose packages/field-memory/src/field-memory.ts:1006 — MethodTooLong — choose runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ArcEpisodeStore.saveAvoCheckpoint packages/arc-agi-3-chatgpt/src/store.ts:593 — MethodTooLong — saveAvoCheckpoint runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ArcEpisodeStore.resumeAvoPersisted packages/arc-agi-3-chatgpt/src/store.ts:1041 — MethodTooLong — resumeAvoPersisted runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
AC4 · Keyboard semantics · Anchor without href · ×8
  • Anchor without href apps/web-ui/public/cost-pareto.html:310 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:311 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:312 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:313 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:314 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:315 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:316 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
  • Anchor without href apps/web-ui/public/cost-pareto.html:317 — An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×8
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:98 — `.calcpanel` moves (`transition: transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:120 — `.book` moves (`transition: transform .25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:134 — `.bookmain section` moves (`animation: fadein .4s ease both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:153 — `.anim-bar` moves (`animation: growbar 1s ease both`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:200 — `.wcard` moves (`transition: transform .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:447 — <circle> moves — its inline style sets `animation: fadein .5s 1.2s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:448 — <circle> moves — its inline style sets `animation: fadein .5s 1.4s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
  • Animation without a prefers-reduced-motion guard apps/web-ui/public/cost-pareto.html:449 — <circle> moves — its inline style sets `animation: fadein .5s 1.6s both` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
D29 · Static Analysis (SAST) · REDACTED · ×8
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
X2 · Cancellation propagation · Async function without AbortSignal · ×8
  • Async function without AbortSignal: complete services/apicompletions/src/providers/openrouter.ts:29 — `complete` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: invoke packages/redblue/src/attacks/sandbox.ts:37 — `invoke` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: loadGsm8kFromHub packages/evals-math/src/data.ts:114 — `loadGsm8kFromHub` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: generateMutation packages/darwin-mode/src/openrouter-mutator.ts:66 — `generateMutation` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: generateMutation packages/darwin-mode/src/requesty-mutator.ts:58 — `generateMutation` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: pinJson packages/create-agent-harness/src/publish.ts:44 — `pinJson` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchRepoFiles apps/web-ui/src/components/RepoImporter.tsx:20 — `fetchRepoFiles` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: waitForServer apps/web-ui/scripts/screenshot.mjs:21 — `waitForServer` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
D29 · Static Analysis (SAST) · REDACTED · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×7
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/archive.ts:52 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/archive.ts:59 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/mutator.ts:278 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/numeric-archive.ts:24 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/numeric-archive.ts:30 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/repo_profiler.ts:50 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/darwin-mode/src/contrastive/memory.ts:107 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
D17 · Explicit Debt · TodoComment · ×5
  • TodoComment services/apicompletions/src/firestore/client.ts:77 — // TODO(impl): admin.initializeApp(); return admin.firestore() as unknown as FirestoreLike. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment services/apicompletions/src/config/index.ts:50 — // TODO(impl): hydrate from env + Firestore tier_config. Skeleton returns static defaults. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment packages/darwin-mode/src/security/codeql-oracle.ts:7 — // present-path is left as a clearly-marked TODO. What ships here is the part that — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment packages/darwin-mode/src/security/codeql-oracle.ts:97 — // TODO(Tier 3 #10): implement the present-path:
  • TodoComment packages/agntcy/src/identity/sign.ts:40 — // TODO(agntcy-identity-signing): once a `witnessSign` binding is added to — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · horizon_core · ×5
  • horizon_core::extract_substitutions (cognitive 28) packages/horizon/crate/src/lib.rs:671 — horizon_core::extract_substitutions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • horizon_core::halt_reduce (cognitive 23) packages/horizon/crate/src/lib.rs:428 — horizon_core::halt_reduce has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • horizon_core::to_json (cognitive 22) packages/horizon/crate/src/lib.rs:97 — horizon_core::to_json has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • horizon_core::classify_command (cognitive 18) packages/horizon/crate/src/lib.rs:831 — horizon_core::classify_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • horizon_core::split_segments (cognitive 17) packages/horizon/crate/src/lib.rs:578 — horizon_core::split_segments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D3 · God Classes · ClassTooLong · ×5
  • ClassTooLong: ArcController packages/arc-agi-3/src/controller.ts:281 — ClassTooLong — 926 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 526 over it, 2.32× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ArcEpisodeStore packages/arc-agi-3-chatgpt/src/store.ts:216 — ClassTooLong — 872 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 472 over it, 2.18× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ArcPlanArchive packages/arc-agi-3/src/plan-archive.ts:364 — ClassTooLong — 550 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 150 over it, 1.38× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ArcAvoLoop packages/arc-agi-3/src/avo-loop.ts:123 — ClassTooLong — 542 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 142 over it, 1.36× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: FieldMemory packages/field-memory/src/field-memory.ts:745 — ClassTooLong — 408 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 8 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D1 · Cyclomatic Complexity · k3rs · ×4
  • k3rs::json::value (cyclomatic 41) kimi-k3-harness/crates/k3rs/src/json.rs:76 — k3rs::json::value has cyclomatic complexity 41 (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.
  • k3rs::model::kda_layer (cyclomatic 19) kimi-k3-harness/crates/k3rs/src/model.rs:436 — k3rs::model::kda_layer has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • k3rs::main (cyclomatic 16) kimi-k3-harness/crates/k3rs/src/main.rs:19 — k3rs::main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • k3rs::model::decoder_layer (cyclomatic 16) kimi-k3-harness/crates/k3rs/src/model.rs:649 — k3rs::model::decoder_layer has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D29 · Static Analysis (SAST) · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
R7 · Dead Code · Dead file (~7 LoC) · ×4
  • Dead file (~7 LoC) kimi-k3-harness/src/agents/architect.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~7 LoC) kimi-k3-harness/src/agents/implementer.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~7 LoC) kimi-k3-harness/src/agents/reviewer.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
  • Dead file (~7 LoC) kimi-k3-harness/src/agents/test-writer.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
D1 · Cyclomatic Complexity · Vm · ×3
  • Vm::builtin (cyclomatic 69) packages/oo-agents/crate/src/lib.rs:1066 — Vm::builtin has cyclomatic complexity 69 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Vm::eval (cyclomatic 45) packages/oo-agents/crate/src/lib.rs:883 — Vm::eval has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Vm::exec (cyclomatic 21) packages/oo-agents/crate/src/lib.rs:800 — Vm::exec has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ooa_cell_vm · ×3
  • ooa_cell_vm::jval (cyclomatic 32) packages/oo-agents/crate/src/lib.rs:129 — ooa_cell_vm::jval has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • ooa_cell_vm::lex (cyclomatic 31) packages/oo-agents/crate/src/lib.rs:272 — ooa_cell_vm::lex has cyclomatic complexity 31 (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.
  • ooa_cell_vm::to_json (cyclomatic 21) packages/oo-agents/crate/src/lib.rs:61 — ooa_cell_vm::to_json has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Parser · ×3
  • Parser::primary (cyclomatic 22) packages/oo-agents/crate/src/lib.rs:661 — Parser::primary 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.
  • Parser::bin (cyclomatic 18) packages/oo-agents/crate/src/lib.rs:568 — Parser::bin has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Parser::stmt (cyclomatic 16) packages/oo-agents/crate/src/lib.rs:472 — Parser::stmt 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.
D2 · Cognitive Complexity · Vm · ×3
  • Vm::builtin (cognitive 98) packages/oo-agents/crate/src/lib.rs:1066 — Vm::builtin has cognitive complexity 98 (threshold 15). Drivers by points: match/switch 25 (54 pts), if/else 15 (34 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 54). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • Vm::eval (cognitive 37) packages/oo-agents/crate/src/lib.rs:883 — Vm::eval has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (9 pts), loops 4 (8 pts) (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • Vm::exec (cognitive 28) packages/oo-agents/crate/src/lib.rs:800 — Vm::exec has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 6 (10 pts), if/else 3 (6 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ooa_cell_vm · ×3
  • ooa_cell_vm::lex (cognitive 54) packages/oo-agents/crate/src/lib.rs:272 — ooa_cell_vm::lex has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (18 pts), match/switch 4 (14 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ooa_cell_vm::jval (cognitive 38) packages/oo-agents/crate/src/lib.rs:129 — ooa_cell_vm::jval has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 6 (17 pts), loops 5 (12 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ooa_cell_vm::to_json (cognitive 27) packages/oo-agents/crate/src/lib.rs:61 — ooa_cell_vm::to_json has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Parser · ×3
  • Parser::primary (cognitive 38) packages/oo-agents/crate/src/lib.rs:661 — Parser::primary has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (10 pts), match/switch 2 (5 pts) (nesting depth added 25). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • Parser::postfix (cognitive 35) packages/oo-agents/crate/src/lib.rs:619 — Parser::postfix has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (11 pts), loops 2 (6 pts) (nesting depth added 23). 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.
  • Parser::stmt (cognitive 25) packages/oo-agents/crate/src/lib.rs:472 — Parser::stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ruflo_kernel · ×3
  • ruflo_kernel::session::validate_log (cognitive 28) crates/kernel/src/session.rs:140 — ruflo_kernel::session::validate_log has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ruflo_kernel::hooks::matcher_matches (cognitive 20) crates/kernel/src/hooks.rs:101 — ruflo_kernel::hooks::matcher_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, match/switch 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.
  • ruflo_kernel::autonomous::validate_autonomous (cognitive 19) crates/kernel/src/autonomous.rs:68 — ruflo_kernel::autonomous::validate_autonomous has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · classifier.heuristicClassifier (cognitive 22) · ×3
  • classifier.heuristicClassifier (cognitive 22) packages/evals-math/src/classifier.ts:21 — classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • classifier.heuristicClassifier (cognitive 22) packages/evals-sql/src/classifier.ts:21 — classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • classifier.heuristicClassifier (cognitive 22) packages/evals-toolcall/src/classifier.ts:25 — classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
R10 · Code Duplication · Duplicated block with local edits (38 matched lines × 2 locations) · ×3
  • Duplicated block with local edits (38 matched lines × 2 locations) packages/darwin-mode/src/refine-mutator.ts:31 — packages/darwin-mode/src/refine-mutator.ts:31 · packages/darwin-mode/src/ruvllm-mutator.ts:26 — the two spans are one implementation copied and then locally edited — 265 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (38 matched lines × 2 locations) packages/evals-hle/src/normalizer.ts:9 — packages/evals-hle/src/normalizer.ts:9 · packages/evals-math/src/normalizer.ts:10 — the two spans are one implementation copied and then locally edited — 366 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (38 matched lines × 2 locations) packages/redblue/src/cli/index.ts:502 — packages/redblue/src/cli/index.ts:502 · packages/weight-eft/src/cli.ts:176 — the two spans are one implementation copied and then locally edited — 236 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
D2 · Cognitive Complexity · poker_darwin · ×2
  • poker_darwin::cfr::cfr_rec (cognitive 26) crates/poker-darwin/src/cfr.rs:431 — poker_darwin::cfr::cfr_rec has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • poker_darwin::cfr::prepare_node (cognitive 17) crates/poker-darwin/src/cfr.rs:359 — poker_darwin::cfr::prepare_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (6 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.
D3 · God Classes · TooManyMethods · ×2
  • TooManyMethods: ArcController packages/arc-agi-3/src/controller.ts:281 — TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ArcEpisodeStore packages/arc-agi-3-chatgpt/src/store.ts:216 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D30 · Dependency Vulnerabilities · Medium CVE · ×2
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · Medium IaC · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×2
  • Duplicated block (11–12 lines × 2) docs/research/retort-placement/analyze2.py:68 — docs/research/retort-placement/analyze2.py:68-79 | docs/research/retort-placement/analyze3.py:87-97 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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 (11–12 lines × 2) crates/kernel/src/dispatch.rs:63 — crates/kernel/src/dispatch.rs:63-74 | crates/kernel/src/dispatch.rs:98-108 — 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 `crates/kernel/src/dispatch.rs:63` 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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×2
  • Duplicated block (9 lines × 2) docs/research/retort-placement/analyze3.py:68 — docs/research/retort-placement/analyze3.py:68-76 | docs/research/retort-placement/analyze4.py:70-78 — before extracting anything, compare `docs/research/retort-placement/analyze3.py` and `docs/research/retort-placement/analyze4.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 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 lines × 2) kimi-k3-harness/crates/k3rs/src/ops.rs:130 — kimi-k3-harness/crates/k3rs/src/ops.rs:130-138 | kimi-k3-harness/crates/k3rs/src/ops.rs:142-150 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2
  • Duplicated block (14 lines × 2) packages/horizon/crate/src/lib.rs:98 — packages/horizon/crate/src/lib.rs:98-111 | packages/oo-agents/crate/src/lib.rs:62-75 — before extracting anything, compare `packages/horizon/crate/src/lib.rs` and `packages/oo-agents/crate/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `packages/horizon/crate/src/lib.rs:98` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (14 lines × 2) packages/horizon/crate/src/lib.rs:139 — packages/horizon/crate/src/lib.rs:139-152 | packages/oo-agents/crate/src/lib.rs:77-90 — before extracting anything, compare `packages/horizon/crate/src/lib.rs` and `packages/oo-agents/crate/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×2
  • Duplicated block (12 lines × 2) packages/oo-agents/crate/src/lib.rs:632 — packages/oo-agents/crate/src/lib.rs:632-643 | packages/oo-agents/crate/src/lib.rs:669-680 — 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 `packages/oo-agents/crate/src/lib.rs:632` 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 × 2) packages/horizon/crate/src/lib.rs:205 — packages/horizon/crate/src/lib.rs:205-216 | packages/horizon/crate/src/lib.rs:230-241 — 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 `packages/horizon/crate/src/lib.rs:205` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) kimi-k3-harness/crates/k3rs/src/ops.rs:326 — kimi-k3-harness/crates/k3rs/src/ops.rs:326-332 | kimi-k3-harness/crates/k3rs/src/ops.rs: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. Read the line range as the matched WINDOW rather than a finished unit: at `kimi-k3-harness/crates/k3rs/src/ops.rs:326` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) kimi-k3-harness/crates/k3rs/src/json.rs:159 — kimi-k3-harness/crates/k3rs/src/json.rs:159-165 | packages/oo-agents/crate/src/lib.rs:166-172 — 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 `kimi-k3-harness/crates/k3rs/src/json.rs:159` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
R10 · Code Duplication · Duplicated block with local edits (59 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (59 matched lines × 2 locations) apps/web-ui/src/generator/repo.ts:233 — apps/web-ui/src/generator/repo.ts:233 · packages/create-agent-harness/src/analyze-repo.ts:163 — the two spans are one implementation copied and then locally edited — 706 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (59 matched lines × 2 locations) kimi-k3-harness/scripts/flywheel-evolve.mjs:39 — kimi-k3-harness/scripts/flywheel-evolve.mjs:39 · packages/radio/scripts/flywheel-radio.mjs:89 — the two spans are one implementation copied and then locally edited — 561 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (47 lines × 2 locations) · ×2
  • Duplicated block (47 lines × 2 locations) packages/evals-hle/src/verifier.ts:10 — packages/evals-hle/src/verifier.ts:10 · packages/evals-math/src/verifier.ts:11 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (47 lines × 2 locations) packages/evals-sql/src/genome.ts:17 — packages/evals-sql/src/genome.ts:17 · packages/evals-toolcall/src/genome.ts:19 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×2
  • JavaScript dependencies are not locked crates/kernel-napi/package.json:17 — crates/kernel-napi/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked kimi-k3-harness/package.json:31 — kimi-k3-harness/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
AC1 · Text alternatives · <canvas> without a text alternative · ×1
  • <canvas> without a text alternative REDACTED:66 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
AC4 · Keyboard semantics · Modal dialog does not manage focus · ×1
  • Modal dialog does not manage focus apps/web-ui/src/components/OnboardingModal.tsx:158 — This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×1
  • Focus outline removed in CSS without a :focus replacement apps/web-ui/src/index.css:47 — `.input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D1 · Cyclomatic Complexity · production-replay.verifyProductionBindings (cyclomatic 99) · ×1
  • production-replay.verifyProductionBindings (cyclomatic 99) packages/flywheel/src/production-replay.ts:13 — production-replay.verifyProductionBindings has cyclomatic complexity 99 (threshold 15). Of this number, 94 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ArcPlanArchive.load (cyclomatic 98) · ×1
  • ArcPlanArchive.load (cyclomatic 98) packages/arc-agi-3/src/plan-archive.ts:793 — ArcPlanArchive.load has cyclomatic complexity 98 (threshold 15). Of this number, 89 points are the body's own statements and 9 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · checkpoint.validateSupervisorState (cyclomatic 95) · ×1
  • checkpoint.validateSupervisorState (cyclomatic 95) packages/arc-agi-3/src/checkpoint.ts:476 — checkpoint.validateSupervisorState has cyclomatic complexity 95 (threshold 15). Of this number, 94 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · field-memory.parseRecord (cyclomatic 87) · ×1
  • field-memory.parseRecord (cyclomatic 87) packages/field-memory/src/field-memory.ts:450 — field-memory.parseRecord has cyclomatic complexity 87 (threshold 15). Of this number, 37 points are the body's own statements and 50 belong to 13 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · production-run.runProductionFlywheel (cyclomatic 87) · ×1
  • production-run.runProductionFlywheel (cyclomatic 87) packages/flywheel/src/production-run.ts:12 — production-run.runProductionFlywheel has cyclomatic complexity 87 (threshold 15). Of this number, 86 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · receipts.validateTransitionReceiptSchema (cyclomatic 74) · ×1
  • receipts.validateTransitionReceiptSchema (cyclomatic 74) packages/arc-agi-3/src/receipts.ts:244 — receipts.validateTransitionReceiptSchema has cyclomatic complexity 74 (threshold 15). Of this number, 72 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · sim.runSim (cyclomatic 70) · ×1
  • sim.runSim (cyclomatic 70) packages/radio/src/sim.ts:451 — sim.runSim 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. This shape REPEATS in the file: one other method here (sim.runSim::applyFold) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · belief-graph.validateBeliefGraphSnapshot (cyclomatic 67) · ×1
  • belief-graph.validateBeliefGraphSnapshot (cyclomatic 67) packages/arc-agi-3/src/belief-graph.ts:77 — belief-graph.validateBeliefGraphSnapshot has cyclomatic complexity 67 (threshold 15). Of this number, 65 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · safety-ast.analyzeSurfaceSource · ×1
  • safety-ast.analyzeSurfaceSource::visit (cyclomatic 66) packages/darwin-mode/src/safety-ast.ts:175 — safety-ast.analyzeSurfaceSource::visit has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · checkpoint.validateCheckpointCrossFields (cyclomatic 64) · ×1
  • checkpoint.validateCheckpointCrossFields (cyclomatic 64) packages/arc-agi-3/src/checkpoint.ts:741 — checkpoint.validateCheckpointCrossFields has cyclomatic complexity 64 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · meta-proxy-service.enableMetaProxyService (cyclomatic 64) · ×1
  • meta-proxy-service.enableMetaProxyService (cyclomatic 64) packages/create-agent-harness/src/meta-proxy-service.ts:392 — meta-proxy-service.enableMetaProxyService has cyclomatic complexity 64 (threshold 15). Of this number, 63 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · evolve.evolve (cyclomatic 57) · ×1
  • evolve.evolve (cyclomatic 57) packages/darwin-mode/src/evolve.ts:311 — evolve.evolve has cyclomatic complexity 57 (threshold 15). Of this number, 50 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · multigeneration-proof.verifyMultiGenerationEvidence (cyclomatic 57) · ×1
  • multigeneration-proof.verifyMultiGenerationEvidence (cyclomatic 57) packages/flywheel/src/multigeneration-proof.ts:276 — multigeneration-proof.verifyMultiGenerationEvidence has cyclomatic complexity 57 (threshold 15). Of this number, 56 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · supervisor.commitTypedSupervisorDirective (cyclomatic 56) · ×1
  • supervisor.commitTypedSupervisorDirective (cyclomatic 56) packages/arc-agi-3/src/supervisor.ts:220 — supervisor.commitTypedSupervisorDirective has cyclomatic complexity 56 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · claim-gate.preregistrationValid (cyclomatic 54) · ×1
  • claim-gate.preregistrationValid (cyclomatic 54) packages/avo/src/claim-gate.ts:462 — claim-gate.preregistrationValid has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · checkpoint.validateCheckpointSchema (cyclomatic 52) · ×1
  • checkpoint.validateCheckpointSchema (cyclomatic 52) packages/arc-agi-3/src/checkpoint.ts:341 — checkpoint.validateCheckpointSchema has cyclomatic complexity 52 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · GovernedVariationOperator.run (cyclomatic 51) · ×1
  • GovernedVariationOperator.run (cyclomatic 51) REDACTED:421 — GovernedVariationOperator.run has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · meta-proxy.metaProxyCmd (cyclomatic 51) · ×1
  • meta-proxy.metaProxyCmd (cyclomatic 51) REDACTED:741 — meta-proxy.metaProxyCmd has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.renderScaffold (cyclomatic 50) · ×1
  • index.renderScaffold (cyclomatic 50) packages/create-agent-harness/src/index.ts:681 — index.renderScaffold has cyclomatic complexity 50 (threshold 15). Of this number, 46 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · canonical.validateExpectation (cyclomatic 49) · ×1
  • canonical.validateExpectation (cyclomatic 49) packages/arc-agi-3/src/canonical.ts:719 — canonical.validateExpectation has cyclomatic complexity 49 (threshold 15). Of this number, 47 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · official-factory.createOfficialArcControllerFactory (cyclomatic 48) · ×1
  • official-factory.createOfficialArcControllerFactory (cyclomatic 48) packages/arc-agi-3-chatgpt/src/official-factory.ts:624 — official-factory.createOfficialArcControllerFactory has cyclomatic complexity 48 (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. This shape REPEATS in the file: one other method here (official-factory.createOfficialArcControllerFactory::captureAvoExecution) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · replay.verifyReplayBundle (cyclomatic 48) · ×1
  • replay.verifyReplayBundle (cyclomatic 48) packages/flywheel/src/replay.ts:96 — replay.verifyReplayBundle has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · meta-proxy-service.disableMetaProxyService (cyclomatic 45) · ×1
  • meta-proxy-service.disableMetaProxyService (cyclomatic 45) packages/create-agent-harness/src/meta-proxy-service.ts:682 — meta-proxy-service.disableMetaProxyService has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · production-gate.validateProductionManifest (cyclomatic 45) · ×1
  • production-gate.validateProductionManifest (cyclomatic 45) packages/flywheel/src/production-gate.ts:186 — production-gate.validateProductionManifest has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · completion.verifyCompletionCertificate (cyclomatic 45) · ×1
  • completion.verifyCompletionCertificate (cyclomatic 45) packages/horizon/src/completion.ts:76 — completion.verifyCompletionCertificate has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EvidenceBackedMemory.commit (cyclomatic 44) · ×1
  • EvidenceBackedMemory.commit (cyclomatic 44) packages/arc-agi-3/src/memory.ts:254 — EvidenceBackedMemory.commit has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ArcPlanArchive.addCandidates (cyclomatic 44) · ×1
  • ArcPlanArchive.addCandidates (cyclomatic 44) packages/arc-agi-3/src/plan-archive.ts:390 — ArcPlanArchive.addCandidates has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ArcAvoLoop.#verifyCheckpointBindings (cyclomatic 44) · ×1
  • ArcAvoLoop.#verifyCheckpointBindings (cyclomatic 44) packages/arc-agi-3/src/avo-loop.ts:657 — ArcAvoLoop.#verifyCheckpointBindings has cyclomatic complexity 44 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · memory.validateStoredRule (cyclomatic 43) · ×1
  • memory.validateStoredRule (cyclomatic 43) packages/arc-agi-3/src/memory.ts:150 — memory.validateStoredRule has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · engine.runContrastive (cyclomatic 43) · ×1
  • engine.runContrastive (cyclomatic 43) packages/darwin-mode/src/contrastive/engine.ts:14 — engine.runContrastive has cyclomatic complexity 43 (threshold 15). Of this number, 18 points are the body's own statements and 25 belong to 8 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · numeric-evolve.evolveNumeric (cyclomatic 42) · ×1
  • numeric-evolve.evolveNumeric (cyclomatic 42) packages/darwin-mode/src/numeric-evolve.ts:57 — numeric-evolve.evolveNumeric has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · production-gate.createProductionManifest (cyclomatic 42) · ×1
  • production-gate.createProductionManifest (cyclomatic 42) packages/flywheel/src/production-gate.ts:90 — production-gate.createProductionManifest has cyclomatic complexity 42 (threshold 15). Of this number, 32 points are the body's own statements and 10 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · checkpoint.validateCheckpointBeliefHistory (cyclomatic 40) · ×1
  • checkpoint.validateCheckpointBeliefHistory (cyclomatic 40) packages/arc-agi-3/src/checkpoint.ts:881 — checkpoint.validateCheckpointBeliefHistory has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · claim-gate.verifyEvidenceBundle (cyclomatic 39) · ×1
  • claim-gate.verifyEvidenceBundle (cyclomatic 39) packages/avo/src/claim-gate.ts:573 — claim-gate.verifyEvidenceBundle has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · protocol.runProtocol (cyclomatic 38) · ×1
  • protocol.runProtocol (cyclomatic 38) packages/radio/src/protocol.ts:195 — protocol.runProtocol has cyclomatic complexity 38 (threshold 15). Of this number, 22 points are the body's own statements and 16 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · mock-target.exampleAgentTarget (cyclomatic 38) · ×1
  • mock-target.exampleAgentTarget (cyclomatic 38) packages/redblue/src/mock-target.ts:47 — mock-target.exampleAgentTarget has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to one function literal inside it that branches (line 48). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · cost-pareto.html.render (cyclomatic 36) · ×1
  • cost-pareto.html.render (cyclomatic 36) apps/web-ui/public/cost-pareto.html:526 — cost-pareto.html.render has cyclomatic complexity 36 (threshold 15). Of this number, 25 points are the body's own statements and 11 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · operator.snapshotAgentJson (cyclomatic 36) · ×1
  • operator.snapshotAgentJson (cyclomatic 36) REDACTED:214 — operator.snapshotAgentJson has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · verify.verifyFileMap (cyclomatic 35) · ×1
  • verify.verifyFileMap (cyclomatic 35) apps/web-ui/src/generator/verify.ts:63 — verify.verifyFileMap has cyclomatic complexity 35 (threshold 15). Of this number, 30 points are the body's own statements and 5 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · claim-gate.parseManifest (cyclomatic 35) · ×1
  • claim-gate.parseManifest (cyclomatic 35) packages/avo/src/claim-gate.ts:319 — claim-gate.parseManifest has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · memory.retrieveContrastiveExperiences (cyclomatic 35) · ×1
  • memory.retrieveContrastiveExperiences (cyclomatic 35) packages/darwin-mode/src/contrastive/memory.ts:75 — memory.retrieveContrastiveExperiences has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FieldMemory.choose (cyclomatic 34) · ×1
  • FieldMemory.choose (cyclomatic 34) packages/field-memory/src/field-memory.ts:1006 — FieldMemory.choose has cyclomatic complexity 34 (threshold 15). Of this number, 32 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · subcommands.doctor (cyclomatic 33) · ×1
  • subcommands.doctor (cyclomatic 33) packages/create-agent-harness/src/subcommands.ts:84 — subcommands.doctor has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · run.runFlywheelGenerations (cyclomatic 33) · ×1
  • run.runFlywheelGenerations (cyclomatic 33) packages/flywheel/src/run.ts:91 — run.runFlywheelGenerations has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BridgeService.dispatch (cyclomatic 33) · ×1
  • BridgeService.dispatch (cyclomatic 33) packages/arc-agi-3/python/bridge.py:574 — BridgeService.dispatch has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FileBudgetLimiter.readState (cyclomatic 32) · ×1
  • FileBudgetLimiter.readState (cyclomatic 32) packages/flywheel/src/budget.ts:297 — FileBudgetLimiter.readState has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · cli.parseArguments (cyclomatic 31) · ×1
  • cli.parseArguments (cyclomatic 31) packages/arc-agi-3-bench/src/cli.ts:45 — cli.parseArguments has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · receipts.validateReceiptContinuation (cyclomatic 31) · ×1
  • receipts.validateReceiptContinuation (cyclomatic 31) packages/arc-agi-3/src/receipts.ts:359 — receipts.validateReceiptContinuation has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · index.parseArgs (cyclomatic 31) · ×1
  • index.parseArgs (cyclomatic 31) packages/create-agent-harness/src/index.ts:191 — index.parseArgs has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · mcp-scan.scanMcp (cyclomatic 31) · ×1
  • mcp-scan.scanMcp (cyclomatic 31) REDACTED:48 — mcp-scan.scanMcp has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · schema.validate (cyclomatic 31) · ×1
  • schema.validate (cyclomatic 31) packages/oo-agents/src/schema.ts:17 — schema.validate has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · h1-submit.gatedSubmit (cyclomatic 31) · ×1
  • h1-submit.gatedSubmit (cyclomatic 31) packages/redblue/src/integrations/h1-submit.ts:160 — h1-submit.gatedSubmit has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ArcAvoLoop.#stepCritical (cyclomatic 30) · ×1
  • ArcAvoLoop.#stepCritical (cyclomatic 30) packages/arc-agi-3/src/avo-loop.ts:338 — ArcAvoLoop.#stepCritical has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.main (cyclomatic 30) · ×1
  • index.main (cyclomatic 30) packages/create-agent-harness/src/index.ts:1113 — index.main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli.main (cyclomatic 30) · ×1
  • cli.main (cyclomatic 30) packages/darwin-mode/src/cli.ts:286 — cli.main 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.
D1 · Cyclomatic Complexity · FieldMemory.update (cyclomatic 30) · ×1
  • FieldMemory.update (cyclomatic 30) packages/field-memory/src/field-memory.ts:788 — FieldMemory.update has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 834, 964). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · production-gate.productionDecision (cyclomatic 30) · ×1
  • production-gate.productionDecision (cyclomatic 30) packages/flywheel/src/production-gate.ts:163 — production-gate.productionDecision has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · audit-cmd.auditCmd (cyclomatic 29) · ×1
  • audit-cmd.auditCmd (cyclomatic 29) packages/create-agent-harness/src/audit-cmd.ts:20 — audit-cmd.auditCmd 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.
D1 · Cyclomatic Complexity · mock-target.alwaysVulnerableFixture (cyclomatic 28) · ×1
  • mock-target.alwaysVulnerableFixture (cyclomatic 28) packages/redblue/src/mock-target.ts:210 — mock-target.alwaysVulnerableFixture has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 211). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · model-driver.validateModelTurnResponse (cyclomatic 27) · ×1
  • model-driver.validateModelTurnResponse (cyclomatic 27) packages/arc-agi-3-bench/src/model-driver.ts:174 — model-driver.validateModelTurnResponse has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · EvidenceBackedMemory.query (cyclomatic 27) · ×1
  • EvidenceBackedMemory.query (cyclomatic 27) packages/arc-agi-3/src/memory.ts:373 — EvidenceBackedMemory.query has cyclomatic complexity 27 (threshold 15). Of this number, 15 points are the body's own statements and 12 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · supervisor.detect (cyclomatic 27) · ×1
  • supervisor.detect (cyclomatic 27) packages/arc-agi-3/src/supervisor.ts:66 — supervisor.detect has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · repo-scorecard.scoreRepoCmd (cyclomatic 27) · ×1
  • repo-scorecard.scoreRepoCmd (cyclomatic 27) packages/create-agent-harness/src/repo-scorecard.ts:248 — repo-scorecard.scoreRepoCmd has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.runMetaHarnessSubcommand (cyclomatic 27) · ×1
  • index.runMetaHarnessSubcommand (cyclomatic 27) packages/create-agent-harness/src/index.ts:955 — index.runMetaHarnessSubcommand has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · analyze-repo.analyzeRepoCmd (cyclomatic 27) · ×1
  • analyze-repo.analyzeRepoCmd (cyclomatic 27) packages/create-agent-harness/src/analyze-repo.ts:364 — analyze-repo.analyzeRepoCmd has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · EvidenceRetrodictiveWorldModel.load (cyclomatic 26) · ×1
  • EvidenceRetrodictiveWorldModel.load (cyclomatic 26) packages/arc-agi-3/src/world-model.ts:163 — EvidenceRetrodictiveWorldModel.load 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.
D1 · Cyclomatic Complexity · generated-mcp.startMcp · ×1
  • generated-mcp.startMcp::handle (cyclomatic 26) packages/create-agent-harness/assets/generated-mcp.mjs:15 — generated-mcp.startMcp::handle has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · genome.genomeCmd (cyclomatic 26) · ×1
  • genome.genomeCmd (cyclomatic 26) packages/create-agent-harness/src/genome.ts:201 — genome.genomeCmd has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · score.scoreCmd (cyclomatic 26) · ×1
  • score.scoreCmd (cyclomatic 26) packages/create-agent-harness/src/score.ts:418 — score.scoreCmd has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · threat-model.threatModelCmd (cyclomatic 26) · ×1
  • threat-model.threatModelCmd (cyclomatic 26) packages/create-agent-harness/src/threat-model.ts:213 — threat-model.threatModelCmd has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ArcEpisodeStore.loadAvoCheckpoint (cyclomatic 25) · ×1
  • ArcEpisodeStore.loadAvoCheckpoint (cyclomatic 25) packages/arc-agi-3-chatgpt/src/store.ts:807 — ArcEpisodeStore.loadAvoCheckpoint has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · official-factory.journalEvidence (cyclomatic 25) · ×1
  • official-factory.journalEvidence (cyclomatic 25) packages/arc-agi-3-chatgpt/src/official-factory.ts:506 — official-factory.journalEvidence has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · official-factory.createOfficialArcControllerFactory · ×1
  • official-factory.createOfficialArcControllerFactory::captureAvoExecution (cyclomatic 25) packages/arc-agi-3-chatgpt/src/official-factory.ts:731 — official-factory.createOfficialArcControllerFactory::captureAvoExecution has cyclomatic complexity 25 (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. This shape REPEATS in the file: one other method here (official-factory.createOfficialArcControllerFactory) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · canonical.snapshotArcJson · ×1
  • canonical.snapshotArcJson::clone (cyclomatic 25) packages/arc-agi-3/src/canonical.ts:180 — canonical.snapshotArcJson::clone has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EvidenceBackedMemory.load (cyclomatic 25) · ×1
  • EvidenceBackedMemory.load (cyclomatic 25) packages/arc-agi-3/src/memory.ts:413 — EvidenceBackedMemory.load has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ArcController.resume (cyclomatic 25) · ×1
  • ArcController.resume (cyclomatic 25) packages/arc-agi-3/src/controller.ts:703 — ArcController.resume has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 704). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · host-config.hostConfigFiles (cyclomatic 25) · ×1
  • host-config.hostConfigFiles (cyclomatic 25) packages/create-agent-harness/src/host-config.ts:109 — host-config.hostConfigFiles has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze4.main (cyclomatic 25) · ×1
  • analyze4.main (cyclomatic 25) docs/research/retort-placement/analyze4.py:104 — analyze4.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scaffold.hostFiles (cyclomatic 24) · ×1
  • scaffold.hostFiles (cyclomatic 24) apps/web-ui/src/generator/scaffold.ts:275 — scaffold.hostFiles has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · claim-gate.armMetricsValid (cyclomatic 24) · ×1
  • claim-gate.armMetricsValid (cyclomatic 24) packages/avo/src/claim-gate.ts:430 — claim-gate.armMetricsValid has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: claim-gate.graderValid (cyclomatic 32) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · claim-gate.evaluateReleaseClaimGate (cyclomatic 24) · ×1
  • claim-gate.evaluateReleaseClaimGate (cyclomatic 24) packages/avo/src/claim-gate.ts:674 — claim-gate.evaluateReleaseClaimGate has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: claim-gate.graderValid (cyclomatic 32) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · validation.snapshot · ×1
  • validation.snapshot::visit (cyclomatic 24) packages/darwin-mode/src/contrastive/validation.ts:32 — validation.snapshot::visit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · checkpoint.assertJsonPayload (cyclomatic 23) · ×1
  • checkpoint.assertJsonPayload (cyclomatic 23) packages/arc-agi-3/src/checkpoint.ts:262 — checkpoint.assertJsonPayload has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ArcAvoLoop.#persistRuleEvidence (cyclomatic 23) · ×1
  • ArcAvoLoop.#persistRuleEvidence (cyclomatic 23) packages/arc-agi-3/src/avo-loop.ts:491 — ArcAvoLoop.#persistRuleEvidence has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · repo-scorecard.buildRepoScorecard (cyclomatic 23) · ×1
  • repo-scorecard.buildRepoScorecard (cyclomatic 23) packages/create-agent-harness/src/repo-scorecard.ts:52 — repo-scorecard.buildRepoScorecard has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · real-evolve.evolveDetectorsReal (cyclomatic 23) · ×1
  • real-evolve.evolveDetectorsReal (cyclomatic 23) packages/darwin-mode/src/security/real-evolve.ts:89 — real-evolve.evolveDetectorsReal has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body's own statements and 10 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · confirmation.confirmContrastive · ×1
  • confirmation.confirmContrastive::execute (cyclomatic 23) packages/darwin-mode/src/contrastive/confirmation.ts:117 — confirmation.confirmContrastive::execute has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · RuVectorFieldStorage.constructor (cyclomatic 23) · ×1
  • RuVectorFieldStorage.constructor (cyclomatic 23) packages/field-memory/src/ruvector-storage.ts:68 — RuVectorFieldStorage.constructor has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · session.parseLog (cyclomatic 23) · ×1
  • session.parseLog (cyclomatic 23) packages/kernel-js/src/session.ts:149 — session.parseLog has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze3.main (cyclomatic 23) · ×1
  • analyze3.main (cyclomatic 23) docs/research/retort-placement/analyze3.py:84 — analyze3.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HarnessBuilder.HarnessBuilder (cyclomatic 22) · ×1
  • HarnessBuilder.HarnessBuilder (cyclomatic 22) apps/web-ui/src/components/HarnessBuilder.tsx:47 — HarnessBuilder.HarnessBuilder has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body's own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ArcEpisodeStore.resumePersisted (cyclomatic 22) · ×1
  • ArcEpisodeStore.resumePersisted (cyclomatic 22) packages/arc-agi-3-chatgpt/src/store.ts:920 — ArcEpisodeStore.resumePersisted has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 939, 991). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · ArcEpisodeStore.resumeAvoPersisted (cyclomatic 22) · ×1
  • ArcEpisodeStore.resumeAvoPersisted (cyclomatic 22) packages/arc-agi-3-chatgpt/src/store.ts:1041 — ArcEpisodeStore.resumeAvoPersisted has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1090, a function literal at line 1133, closeRecord, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · canonical.validateArcAction (cyclomatic 22) · ×1
  • canonical.validateArcAction (cyclomatic 22) packages/arc-agi-3/src/canonical.ts:685 — canonical.validateArcAction has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · oia-manifest.oiaManifestCmd (cyclomatic 22) · ×1
  • oia-manifest.oiaManifestCmd (cyclomatic 22) packages/create-agent-harness/src/oia-manifest.ts:237 — oia-manifest.oiaManifestCmd has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · bridge._observation (cyclomatic 22) · ×1
  • bridge._observation (cyclomatic 22) packages/arc-agi-3/python/bridge.py:356 — bridge._observation has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · lib.runSeed (cyclomatic 21) · ×1
  • lib.runSeed (cyclomatic 21) experiments/router-calibration-loop/lib.mjs:154 — lib.runSeed has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ArcEpisodeStore.loadCheckpoint (cyclomatic 21) · ×1
  • ArcEpisodeStore.loadCheckpoint (cyclomatic 21) packages/arc-agi-3-chatgpt/src/store.ts:729 — ArcEpisodeStore.loadCheckpoint 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.
D1 · Cyclomatic Complexity · server.createArcMcpRuntime.server (cyclomatic 21) · ×1
  • server.createArcMcpRuntime.server (cyclomatic 21) REDACTED:403 — server.createArcMcpRuntime.server has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ArcController.commitDirectiveCriticalSection (cyclomatic 21) · ×1
  • ArcController.commitDirectiveCriticalSection (cyclomatic 21) packages/arc-agi-3/src/controller.ts:1223 — ArcController.commitDirectiveCriticalSection has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · federate.federateDispatch (cyclomatic 21) · ×1
  • federate.federateDispatch (cyclomatic 21) packages/create-agent-harness/src/federate.ts:83 — federate.federateDispatch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · upgrade.applyPlan (cyclomatic 21) · ×1
  • upgrade.applyPlan (cyclomatic 21) packages/create-agent-harness/src/upgrade.ts:161 — upgrade.applyPlan has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · scorer.scoreVariant (cyclomatic 21) · ×1
  • scorer.scoreVariant (cyclomatic 21) packages/darwin-mode/src/scorer.ts:113 — scorer.scoreVariant has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · FannSurrogate.fit (cyclomatic 21) · ×1
  • FannSurrogate.fit (cyclomatic 21) packages/darwin-mode/src/fann-surrogate.ts:188 — FannSurrogate.fit has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · validation.validateDocument (cyclomatic 21) · ×1
  • validation.validateDocument (cyclomatic 21) packages/darwin-mode/src/contrastive/validation.ts:78 — validation.validateDocument has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · loader.parseYaml (cyclomatic 21) · ×1
  • loader.parseYaml (cyclomatic 21) packages/redblue/src/config/loader.ts:77 — loader.parseYaml has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body's own statements and 10 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HackerOneClient.weaknessesFull (cyclomatic 21) · ×1
  • HackerOneClient.weaknessesFull (cyclomatic 21) packages/redblue/src/integrations/hackerone.ts:437 — HackerOneClient.weaknessesFull has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HackerOneClient.probeWriteScope (cyclomatic 21) · ×1
  • HackerOneClient.probeWriteScope (cyclomatic 21) packages/redblue/src/integrations/hackerone.ts:693 — HackerOneClient.probeWriteScope 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.
D1 · Cyclomatic Complexity · reward-hack.toolResponses (cyclomatic 21) · ×1
  • reward-hack.toolResponses (cyclomatic 21) packages/weight-eft/src/reward-hack.ts:106 — reward-hack.toolResponses has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RepoImporter.RepoImporter (cyclomatic 20) · ×1
  • RepoImporter.RepoImporter (cyclomatic 20) apps/web-ui/src/components/RepoImporter.tsx:44 — RepoImporter.RepoImporter has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body's own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · model-driver.assertPlainJson (cyclomatic 20) · ×1
  • model-driver.assertPlainJson (cyclomatic 20) packages/arc-agi-3-bench/src/model-driver.ts:83 — model-driver.assertPlainJson has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · canonical.validateExactArcObservation (cyclomatic 20) · ×1
  • canonical.validateExactArcObservation (cyclomatic 20) packages/arc-agi-3/src/canonical.ts:617 — canonical.validateExactArcObservation has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ArcPlanArchive.select (cyclomatic 20) · ×1
  • ArcPlanArchive.select (cyclomatic 20) packages/arc-agi-3/src/plan-archive.ts:551 — ArcPlanArchive.select has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body's own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PythonArcBridge.#disposeAfterQueue (cyclomatic 20) · ×1
  • PythonArcBridge.#disposeAfterQueue (cyclomatic 20) packages/arc-agi-3/src/python-bridge.ts:891 — PythonArcBridge.#disposeAfterQueue has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · meta-proxy-service.parseManagerState (cyclomatic 20) · ×1
  • meta-proxy-service.parseManagerState (cyclomatic 20) packages/create-agent-harness/src/meta-proxy-service.ts:302 — meta-proxy-service.parseManagerState has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · confirmation.confirmContrastive (cyclomatic 20) · ×1
  • confirmation.confirmContrastive (cyclomatic 20) packages/darwin-mode/src/contrastive/confirmation.ts:72 — confirmation.confirmContrastive has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive::execute) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · FieldMemory.importState (cyclomatic 20) · ×1
  • FieldMemory.importState (cyclomatic 20) packages/field-memory/src/field-memory.ts:1220 — FieldMemory.importState has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · export.exportTrainingData (cyclomatic 20) · ×1
  • export.exportTrainingData (cyclomatic 20) packages/weight-eft/src/export.ts:135 — export.exportTrainingData has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · bridge._grid_frame (cyclomatic 20) · ×1
  • bridge._grid_frame (cyclomatic 20) packages/arc-agi-3/python/bridge.py:312 — bridge._grid_frame has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · horizon_core · ×1
  • horizon_core::split_segments (cyclomatic 20) packages/horizon/crate/src/lib.rs:578 — horizon_core::split_segments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · make-charts.chart7 (cyclomatic 19) · ×1
  • make-charts.chart7 (cyclomatic 19) docs/research/cheap-vs-frontier/make-charts.mjs:260 — make-charts.chart7 has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · receipts.reconcileTransitionReceipts (cyclomatic 19) · ×1
  • receipts.reconcileTransitionReceipts (cyclomatic 19) packages/arc-agi-3/src/receipts.ts:573 — receipts.reconcileTransitionReceipts 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.
D1 · Cyclomatic Complexity · cli.dispatch (cyclomatic 19) · ×1
  • cli.dispatch (cyclomatic 19) packages/avo/src/cli.ts:45 — cli.dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compare-cmd.formatReport (cyclomatic 19) · ×1
  • compare-cmd.formatReport (cyclomatic 19) packages/create-agent-harness/src/compare-cmd.ts:142 — compare-cmd.formatReport has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · witness-client.verifyWitness (cyclomatic 19) · ×1
  • witness-client.verifyWitness (cyclomatic 19) packages/create-agent-harness/src/witness-client.ts:52 — witness-client.verifyWitness has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · upgrade-cmd.upgradeCmd (cyclomatic 19) · ×1
  • upgrade-cmd.upgradeCmd (cyclomatic 19) packages/create-agent-harness/src/upgrade-cmd.ts:45 — upgrade-cmd.upgradeCmd has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · normalizer.canonValue (cyclomatic 19) · ×1
  • normalizer.canonValue (cyclomatic 19) packages/evals-extract/src/normalizer.ts:91 — normalizer.canonValue has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · evaluator.clampLever (cyclomatic 19) · ×1
  • evaluator.clampLever (cyclomatic 19) packages/evals-sql/src/evaluator.ts:174 — evaluator.clampLever has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · sim.runSim · ×1
  • sim.runSim::applyFold (cyclomatic 19) packages/radio/src/sim.ts:605 — sim.runSim::applyFold 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. This shape REPEATS in the file: one other method here (sim.runSim) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · CatalogPicker.CatalogPicker (cyclomatic 18) · ×1
  • CatalogPicker.CatalogPicker (cyclomatic 18) apps/web-ui/src/components/CatalogPicker.tsx:12 — CatalogPicker.CatalogPicker has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body's own statements and 7 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · report.buildBenchmarkReport (cyclomatic 18) · ×1
  • report.buildBenchmarkReport (cyclomatic 18) packages/arc-agi-3-bench/src/report.ts:62 — report.buildBenchmarkReport has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 102, 126). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · ArcEpisodeStore.saveAvoCheckpoint (cyclomatic 18) · ×1
  • ArcEpisodeStore.saveAvoCheckpoint (cyclomatic 18) packages/arc-agi-3-chatgpt/src/store.ts:593 — ArcEpisodeStore.saveAvoCheckpoint has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 602, 640). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · ArcController.actCriticalSection (cyclomatic 18) · ×1
  • ArcController.actCriticalSection (cyclomatic 18) packages/arc-agi-3/src/controller.ts:904 — ArcController.actCriticalSection has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · avo-config.resolveFeatures (cyclomatic 18) · ×1
  • avo-config.resolveFeatures (cyclomatic 18) packages/arc-agi-3/src/avo-config.ts:116 — avo-config.resolveFeatures has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · python-bridge.parseObservation (cyclomatic 18) · ×1
  • python-bridge.parseObservation (cyclomatic 18) packages/arc-agi-3/src/python-bridge.ts:313 — python-bridge.parseObservation has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SemanticSupervisor.observe (cyclomatic 18) · ×1
  • SemanticSupervisor.observe (cyclomatic 18) packages/avo/src/supervisor.ts:47 — SemanticSupervisor.observe has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · field-memory-scaffold.integrateFieldMemory (cyclomatic 18) · ×1
  • field-memory-scaffold.integrateFieldMemory (cyclomatic 18) packages/create-agent-harness/src/field-memory-scaffold.ts:70 — field-memory-scaffold.integrateFieldMemory has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze-repo.analyzeFiles (cyclomatic 18) · ×1
  • analyze-repo.analyzeFiles (cyclomatic 18) packages/create-agent-harness/src/analyze-repo.ts:162 — analyze-repo.analyzeFiles has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · threat-model.buildThreatModel (cyclomatic 18) · ×1
  • threat-model.buildThreatModel (cyclomatic 18) packages/create-agent-harness/src/threat-model.ts:62 — threat-model.buildThreatModel has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · metric.analyzeTranscript (cyclomatic 18) · ×1
  • metric.analyzeTranscript (cyclomatic 18) packages/darwin-mode/src/gepa/metric.ts:56 — metric.analyzeTranscript has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · metric.classifyFailure (cyclomatic 18) · ×1
  • metric.classifyFailure (cyclomatic 18) packages/darwin-mode/src/gepa/metric.ts:194 — metric.classifyFailure has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · loop.gepaOptimize (cyclomatic 18) · ×1
  • loop.gepaOptimize (cyclomatic 18) packages/darwin-mode/src/gepa/loop.ts:233 — loop.gepaOptimize has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · normalizer.parseKeywordArgs (cyclomatic 18) · ×1
  • normalizer.parseKeywordArgs (cyclomatic 18) packages/evals-toolcall/src/normalizer.ts:103 — normalizer.parseKeywordArgs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · evaluator.makeToolcallEvaluator.evaluate (cyclomatic 18) · ×1
  • evaluator.makeToolcallEvaluator.evaluate (cyclomatic 18) packages/evals-toolcall/src/evaluator.ts:51 — evaluator.makeToolcallEvaluator.evaluate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · validate-bundle.validateLineageCommit (cyclomatic 18) · ×1
  • validate-bundle.validateLineageCommit (cyclomatic 18) packages/flywheel/src/validate-bundle.ts:55 — validate-bundle.validateLineageCommit has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · repo.analyzeFiles (cyclomatic 17) · ×1
  • repo.analyzeFiles (cyclomatic 17) apps/web-ui/src/generator/repo.ts:231 — repo.analyzeFiles has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · make-scaffold-chart.curveSvg (cyclomatic 17) · ×1
  • make-scaffold-chart.curveSvg (cyclomatic 17) docs/research/scaffolding/make-scaffold-chart.mjs:64 — make-scaffold-chart.curveSvg has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · canonical.validateFrame (cyclomatic 17) · ×1
  • canonical.validateFrame (cyclomatic 17) packages/arc-agi-3/src/canonical.ts:422 — canonical.validateFrame has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · swebench.evaluateShipGate (cyclomatic 17) · ×1
  • swebench.evaluateShipGate (cyclomatic 17) packages/avo/src/swebench.ts:106 — swebench.evaluateShipGate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · claim-gate.validateClaimSurfaces (cyclomatic 17) · ×1
  • claim-gate.validateClaimSurfaces (cyclomatic 17) packages/avo/src/claim-gate.ts:383 — claim-gate.validateClaimSurfaces 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. This is NOT this file's highest cyclomatic complexity: claim-gate.graderValid (cyclomatic 32) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · operator.assertVariationAction (cyclomatic 17) · ×1
  • operator.assertVariationAction (cyclomatic 17) REDACTED:317 — operator.assertVariationAction has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · diag.buildSupportBundle (cyclomatic 17) · ×1
  • diag.buildSupportBundle (cyclomatic 17) packages/create-agent-harness/src/diag.ts:404 — diag.buildSupportBundle has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · normalizer.normalizeAnswer (cyclomatic 17) · ×1
  • normalizer.normalizeAnswer (cyclomatic 17) packages/evals-math/src/normalizer.ts:23 — normalizer.normalizeAnswer has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EscalationScheduler.run (cyclomatic 17) · ×1
  • EscalationScheduler.run (cyclomatic 17) packages/projects/src/scheduler.ts:105 — EscalationScheduler.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · chatCompletions.makeChatCompletions.postChatCompletions (cyclomatic 17) · ×1
  • chatCompletions.makeChatCompletions.postChatCompletions (cyclomatic 17) REDACTED:65 — chatCompletions.makeChatCompletions.postChatCompletions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · chatCompletions.streamResponse (cyclomatic 17) · ×1
  • chatCompletions.streamResponse (cyclomatic 17) REDACTED:219 — chatCompletions.streamResponse has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · messages.makeMessages.postMessages (cyclomatic 17) · ×1
  • messages.makeMessages.postMessages (cyclomatic 17) REDACTED:74 — messages.makeMessages.postMessages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cost-pareto.html.renderCalc (cyclomatic 16) · ×1
  • cost-pareto.html.renderCalc (cyclomatic 16) apps/web-ui/public/cost-pareto.html:616 — cost-pareto.html.renderCalc has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · verify.mcpServerPresent (cyclomatic 16) · ×1
  • verify.mcpServerPresent (cyclomatic 16) apps/web-ui/src/generator/verify.ts:33 — verify.mcpServerPresent has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BenchmarkPlanner.propose (cyclomatic 16) · ×1
  • BenchmarkPlanner.propose (cyclomatic 16) packages/arc-agi-3-bench/src/bench-planner.ts:37 — BenchmarkPlanner.propose has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · auth.authenticate (cyclomatic 16) · ×1
  • auth.authenticate (cyclomatic 16) packages/arc-agi-3-chatgpt/src/auth.ts:239 — auth.authenticate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · official-factory.scorecardRuns (cyclomatic 16) · ×1
  • official-factory.scorecardRuns (cyclomatic 16) packages/arc-agi-3-chatgpt/src/official-factory.ts:459 — official-factory.scorecardRuns has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · canonical.toSafeJson (cyclomatic 16) · ×1
  • canonical.toSafeJson (cyclomatic 16) packages/arc-agi-3/src/canonical.ts:315 — canonical.toSafeJson has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · canonical.validateExactGridFrame (cyclomatic 16) · ×1
  • canonical.validateExactGridFrame (cyclomatic 16) packages/arc-agi-3/src/canonical.ts:486 — canonical.validateExactGridFrame has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · receipts.verifyTransitionReceipts (cyclomatic 16) · ×1
  • receipts.verifyTransitionReceipts (cyclomatic 16) packages/arc-agi-3/src/receipts.ts:517 — receipts.verifyTransitionReceipts has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · learn.parseLearnArgs (cyclomatic 16) · ×1
  • learn.parseLearnArgs (cyclomatic 16) packages/create-agent-harness/src/learn.ts:93 — learn.parseLearnArgs has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · wizard.runWizard (cyclomatic 16) · ×1
  • wizard.runWizard (cyclomatic 16) packages/create-agent-harness/src/wizard.ts:72 — wizard.runWizard has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · score.scoreMcpSafety (cyclomatic 16) · ×1
  • score.scoreMcpSafety (cyclomatic 16) packages/create-agent-harness/src/score.ts:174 — score.scoreMcpSafety has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · safety.inspectVariant (cyclomatic 16) · ×1
  • safety.inspectVariant (cyclomatic 16) packages/darwin-mode/src/safety.ts:133 — safety.inspectVariant has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · classifier.heuristicClassifier (cyclomatic 16) · ×1
  • classifier.heuristicClassifier (cyclomatic 16) packages/evals-toolcall/src/classifier.ts:25 — classifier.heuristicClassifier has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · gate.meetsPromotionRule (cyclomatic 16) · ×1
  • gate.meetsPromotionRule (cyclomatic 16) packages/flywheel/src/gate.ts:52 — gate.meetsPromotionRule has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · reward-hack.detectRewardHack (cyclomatic 16) · ×1
  • reward-hack.detectRewardHack (cyclomatic 16) packages/weight-eft/src/reward-hack.ts:170 — reward-hack.detectRewardHack has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · inflight.streamInflight (cyclomatic 16) · ×1
  • inflight.streamInflight (cyclomatic 16) services/apicompletions/src/midstream/inflight.ts:133 — inflight.streamInflight has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze2.main (cyclomatic 16) · ×1
  • analyze2.main (cyclomatic 16) docs/research/retort-placement/analyze2.py:64 — analyze2.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Genome · ×1
  • Genome::mutate (cyclomatic 16) crates/poker-darwin/src/darwin.rs:254 — Genome::mutate has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D10 · Test Quality · Skipped test · ×1
  • Skipped test: (skipped: no Directory server reachable at ${TEST_SERVER_ADDRESS} — run docker compose up in agntcy/dir's install/docker/ to exercise this test live) packages/agntcy/src/oasf/__tests__/publish.test.ts:213 — Skipped — switched off by it.skip
D10 · Test Quality · Fixed-sleep synchronisation · ×1
  • Fixed-sleep synchronisation: serializes concurrent callers so only one request is in flight packages/arc-agi-3/__tests__/python-bridge.test.ts:305 — This test starts work it did not wait for (`first`, still running when the sleep starts) and then orders itself against it with `new Promise((resolve) => setTimeout(resolve, 5))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: scripts/dream-release.mjs scripts/dream-release.mjs:17 — scripts/dream-release.mjs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is dream-release.run at line 17), AT OR 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(agntcy, agent-harness-generator): install without the Buf registry; scaffold across filesystems; ADR-356 residuals (#490)”; “fix(release): build and verify wasm in Release; pin wasm tools to crates.io (unblocks horizon 0.2.2) (#486)”; “fix(release): wait out npm staged publish and CDN-cached 404s before byte verification (#472)”; “fix(release): correct provenance metadata for Dream 0.4.19 (#427)”. 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-13 17:18:43 -05:00' --until='2026-11-11 17:18:43 -05:00' --full-history --no-merges -- scripts/dream-release.mjs`: 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.
D2 · Cognitive Complexity · sim.runSim (cognitive 191) · ×1
  • sim.runSim (cognitive 191) packages/radio/src/sim.ts:451 — sim.runSim has cognitive complexity 191 (threshold 15). Drivers by points: if/else 60 (158 pts), loops 29 (77 pts), boolean chains 20, ternaries 5 (10 pts) (nesting depth added 151). 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. This shape REPEATS in the file: one other method here (sim.runSim::applyFold) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · meta-proxy-service.enableMetaProxyService (cognitive 146) · ×1
  • meta-proxy-service.enableMetaProxyService (cognitive 146) packages/create-agent-harness/src/meta-proxy-service.ts:392 — meta-proxy-service.enableMetaProxyService has cognitive complexity 146 (threshold 15). Drivers by points: if/else 29 (102 pts), ternaries 7 (22 pts), boolean chains 21, loops 1 (nesting depth added 88). Of this number, 145 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · checkpoint.validateSupervisorState (cognitive 126) · ×1
  • checkpoint.validateSupervisorState (cognitive 126) packages/arc-agi-3/src/checkpoint.ts:476 — checkpoint.validateSupervisorState has cognitive complexity 126 (threshold 15). Drivers by points: if/else 40 (78 pts), boolean chains 33, loops 7 (10 pts), ternaries 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.
D2 · Cognitive Complexity · evolve.evolve (cognitive 125) · ×1
  • evolve.evolve (cognitive 125) packages/darwin-mode/src/evolve.ts:311 — evolve.evolve has cognitive complexity 125 (threshold 15). Drivers by points: if/else 22 (55 pts), ternaries 14 (46 pts), loops 6 (15 pts), boolean chains 9 (nesting depth added 74). Of this number, 100 points are the body's own statements and 25 belong to 4 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · production-run.runProductionFlywheel (cognitive 124) · ×1
  • production-run.runProductionFlywheel (cognitive 124) packages/flywheel/src/production-run.ts:12 — production-run.runProductionFlywheel has cognitive complexity 124 (threshold 15). Drivers by points: ternaries 18 (50 pts), if/else 20 (40 pts), boolean chains 21, loops 4 (7 pts), error handling 2 (6 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · meta-proxy.metaProxyCmd (cognitive 92) · ×1
  • meta-proxy.metaProxyCmd (cognitive 92) REDACTED:741 — meta-proxy.metaProxyCmd has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 24 (60 pts), if/else 20 (28 pts), boolean chains 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · numeric-evolve.evolveNumeric (cognitive 90) · ×1
  • numeric-evolve.evolveNumeric (cognitive 90) packages/darwin-mode/src/numeric-evolve.ts:57 — numeric-evolve.evolveNumeric has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (44 pts), ternaries 7 (19 pts), loops 7 (17 pts), boolean chains 6, error handling 1 (4 pts) (nesting depth added 49). Of this number, 86 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · field-memory.parseRecord (cognitive 90) · ×1
  • field-memory.parseRecord (cognitive 90) packages/field-memory/src/field-memory.ts:450 — field-memory.parseRecord has cognitive complexity 90 (threshold 15). Drivers by points: if/else 57 (64 pts), boolean chains 20, loops 5 (6 pts) (nesting depth added 8). Of this number, 40 points are the body's own statements and 50 belong to 13 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · GovernedVariationOperator.run (cognitive 88) · ×1
  • GovernedVariationOperator.run (cognitive 88) REDACTED:421 — GovernedVariationOperator.run has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (59 pts), boolean chains 14, ternaries 4 (8 pts), error handling 1 (5 pts), loops 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · production-replay.verifyProductionBindings (cognitive 87) · ×1
  • production-replay.verifyProductionBindings (cognitive 87) packages/flywheel/src/production-replay.ts:13 — production-replay.verifyProductionBindings has cognitive complexity 87 (threshold 15). Drivers by points: if/else 30 (56 pts), boolean chains 27, loops 3, error handling 1 (nesting depth added 26). Of this number, 85 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · multigeneration-proof.verifyMultiGenerationEvidence (cognitive 86) · ×1
  • multigeneration-proof.verifyMultiGenerationEvidence (cognitive 86) packages/flywheel/src/multigeneration-proof.ts:276 — multigeneration-proof.verifyMultiGenerationEvidence has cognitive complexity 86 (threshold 15). Drivers by points: if/else 33 (60 pts), boolean chains 14, ternaries 3 (6 pts), loops 3 (5 pts), error handling 1 (nesting depth added 32). Of this number, 85 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.renderScaffold (cognitive 83) · ×1
  • index.renderScaffold (cognitive 83) packages/create-agent-harness/src/index.ts:681 — index.renderScaffold has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (47 pts), error handling 5 (13 pts), loops 5 (12 pts), boolean chains 10, ternaries 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · completion.verifyCompletionCertificate (cognitive 83) · ×1
  • completion.verifyCompletionCertificate (cognitive 83) packages/horizon/src/completion.ts:76 — completion.verifyCompletionCertificate has cognitive complexity 83 (threshold 15). Drivers by points: if/else 27 (63 pts), boolean chains 9, loops 5 (6 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · meta-proxy-service.disableMetaProxyService (cognitive 82) · ×1
  • meta-proxy-service.disableMetaProxyService (cognitive 82) packages/create-agent-harness/src/meta-proxy-service.ts:682 — meta-proxy-service.disableMetaProxyService has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (42 pts), ternaries 10 (29 pts), boolean chains 11 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · replay.verifyReplayBundle (cognitive 74) · ×1
  • replay.verifyReplayBundle (cognitive 74) packages/flywheel/src/replay.ts:96 — replay.verifyReplayBundle has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 12, loops 4 (7 pts), ternaries 4 (7 pts), error handling 1 (2 pts) (nesting depth added 30). Of this number, 72 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcPlanArchive.load (cognitive 73) · ×1
  • ArcPlanArchive.load (cognitive 73) packages/arc-agi-3/src/plan-archive.ts:793 — ArcPlanArchive.load has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 21, loops 9 (12 pts), error handling 5 (8 pts), ternaries 2 (4 pts) (nesting depth added 19). Of this number, 67 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcPlanArchive.addCandidates (cognitive 72) · ×1
  • ArcPlanArchive.addCandidates (cognitive 72) packages/arc-agi-3/src/plan-archive.ts:390 — ArcPlanArchive.addCandidates has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 13, loops 5 (8 pts), ternaries 2 (4 pts), error handling 1 (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.
D2 · Cognitive Complexity · safety-ast.analyzeSurfaceSource · ×1
  • safety-ast.analyzeSurfaceSource::visit (cognitive 70) packages/darwin-mode/src/safety-ast.ts:175 — safety-ast.analyzeSurfaceSource::visit has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (45 pts), boolean chains 15, loops 4 (8 pts), match/switch 1, ternaries 1 (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.
D2 · Cognitive Complexity · run.runFlywheelGenerations (cognitive 63) · ×1
  • run.runFlywheelGenerations (cognitive 63) packages/flywheel/src/run.ts:91 — run.runFlywheelGenerations has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 13 (36 pts), if/else 8 (11 pts), loops 4 (7 pts), boolean chains 6, error handling 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · verify.verifyFileMap (cognitive 60) · ×1
  • verify.verifyFileMap (cognitive 60) apps/web-ui/src/generator/verify.ts:63 — verify.verifyFileMap has cognitive complexity 60 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 13, error handling 4 (7 pts), ternaries 3 (nesting depth added 14). Of this number, 56 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · official-factory.createOfficialArcControllerFactory (cognitive 59) · ×1
  • official-factory.createOfficialArcControllerFactory (cognitive 59) packages/arc-agi-3-chatgpt/src/official-factory.ts:624 — official-factory.createOfficialArcControllerFactory has cognitive complexity 59 (threshold 15). Drivers by points: boolean chains 32, if/else 19 (20 pts), ternaries 5, error handling 1, loops 1 (nesting depth added 1). Of this number, 38 points are the body's own statements and 21 belong to 14 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · BridgeService.dispatch (cognitive 53) · ×1
  • BridgeService.dispatch (cognitive 53) packages/arc-agi-3/python/bridge.py:574 — BridgeService.dispatch has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 7, error handling 1 (4 pts), loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FieldMemory.choose (cognitive 52) · ×1
  • FieldMemory.choose (cognitive 52) packages/field-memory/src/field-memory.ts:1006 — FieldMemory.choose has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (10 pts), boolean chains 9, ternaries 4 (6 pts) (nesting depth added 21). Of this number, 50 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · schema.validate (cognitive 52) · ×1
  • schema.validate (cognitive 52) packages/oo-agents/src/schema.ts:17 — schema.validate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (8 pts), boolean chains 5, ternaries 2 (4 pts), match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · claim-gate.verifyEvidenceBundle (cognitive 51) · ×1
  • claim-gate.verifyEvidenceBundle (cognitive 51) packages/avo/src/claim-gate.ts:573 — claim-gate.verifyEvidenceBundle has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · belief-graph.validateBeliefGraphSnapshot (cognitive 46) · ×1
  • belief-graph.validateBeliefGraphSnapshot (cognitive 46) packages/arc-agi-3/src/belief-graph.ts:77 — belief-graph.validateBeliefGraphSnapshot has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 16, loops 4 (7 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.
D2 · Cognitive Complexity · checkpoint.validateCheckpointCrossFields (cognitive 46) · ×1
  • checkpoint.validateCheckpointCrossFields (cognitive 46) packages/arc-agi-3/src/checkpoint.ts:741 — checkpoint.validateCheckpointCrossFields has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 14, ternaries 3 (9 pts), loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcAvoLoop.#stepCritical (cognitive 46) · ×1
  • ArcAvoLoop.#stepCritical (cognitive 46) packages/arc-agi-3/src/avo-loop.ts:338 — ArcAvoLoop.#stepCritical has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 7 (13 pts), boolean chains 4, error handling 2 (3 pts), loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · repo-scorecard.scoreRepoCmd (cognitive 44) · ×1
  • repo-scorecard.scoreRepoCmd (cognitive 44) packages/create-agent-harness/src/repo-scorecard.ts:248 — repo-scorecard.scoreRepoCmd has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 9 (15 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 18). Of this number, 40 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.
D2 · Cognitive Complexity · receipts.validateTransitionReceiptSchema (cognitive 43) · ×1
  • receipts.validateTransitionReceiptSchema (cognitive 43) packages/arc-agi-3/src/receipts.ts:244 — receipts.validateTransitionReceiptSchema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 19, loops 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · canonical.validateExpectation (cognitive 42) · ×1
  • canonical.validateExpectation (cognitive 42) packages/arc-agi-3/src/canonical.ts:719 — canonical.validateExpectation has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 17, 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.
D2 · Cognitive Complexity · lib.runSeed (cognitive 41) · ×1
  • lib.runSeed (cognitive 41) experiments/router-calibration-loop/lib.mjs:154 — lib.runSeed has cognitive complexity 41 (threshold 15). Drivers by points: loops 13 (22 pts), ternaries 4 (12 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · engine.runContrastive (cognitive 41) · ×1
  • engine.runContrastive (cognitive 41) packages/darwin-mode/src/contrastive/engine.ts:14 — engine.runContrastive has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 10, ternaries 4 (6 pts), error handling 4, loops 1 (nesting depth added 4). Most of this is not in the body itself: 13 of the 41 points are its own statements and the rest belongs to 8 function items inside it that branch (invoke, consider, a function literal at line 70, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · audit-cmd.auditCmd (cognitive 40) · ×1
  • audit-cmd.auditCmd (cognitive 40) packages/create-agent-harness/src/audit-cmd.ts:20 — audit-cmd.auditCmd has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 5 (7 pts), error handling 4 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.main (cognitive 39) · ×1
  • index.main (cognitive 39) packages/create-agent-harness/src/index.ts:1113 — index.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 4 (7 pts), loops 3 (5 pts), boolean chains 4, 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.
D2 · Cognitive Complexity · reward-hack.toolResponses (cognitive 39) · ×1
  • reward-hack.toolResponses (cognitive 39) packages/weight-eft/src/reward-hack.ts:106 — reward-hack.toolResponses has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cost-pareto.html.render (cognitive 38) · ×1
  • cost-pareto.html.render (cognitive 38) apps/web-ui/public/cost-pareto.html:526 — cost-pareto.html.render has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 8 (11 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 14). Of this number, 32 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · supervisor.commitTypedSupervisorDirective (cognitive 38) · ×1
  • supervisor.commitTypedSupervisorDirective (cognitive 38) packages/arc-agi-3/src/supervisor.ts:220 — supervisor.commitTypedSupervisorDirective has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 16, loops 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · memory.retrieveContrastiveExperiences (cognitive 38) · ×1
  • memory.retrieveContrastiveExperiences (cognitive 38) packages/darwin-mode/src/contrastive/memory.ts:75 — memory.retrieveContrastiveExperiences has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 10, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 14). Of this number, 37 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim.runSim · ×1
  • sim.runSim::applyFold (cognitive 38) packages/radio/src/sim.ts:605 — sim.runSim::applyFold has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 2 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (sim.runSim) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · genome.genomeCmd (cognitive 37) · ×1
  • genome.genomeCmd (cognitive 37) packages/create-agent-harness/src/genome.ts:201 — genome.genomeCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.parseArgs (cognitive 37) · ×1
  • index.parseArgs (cognitive 37) packages/create-agent-harness/src/index.ts:191 — index.parseArgs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · score.scoreCmd (cognitive 37) · ×1
  • score.scoreCmd (cognitive 37) packages/create-agent-harness/src/score.ts:418 — score.scoreCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · threat-model.threatModelCmd (cognitive 37) · ×1
  • threat-model.threatModelCmd (cognitive 37) packages/create-agent-harness/src/threat-model.ts:213 — threat-model.threatModelCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EscalationScheduler.run (cognitive 37) · ×1
  • EscalationScheduler.run (cognitive 37) packages/projects/src/scheduler.ts:105 — EscalationScheduler.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · h1-submit.gatedSubmit (cognitive 37) · ×1
  • h1-submit.gatedSubmit (cognitive 37) packages/redblue/src/integrations/h1-submit.ts:160 — h1-submit.gatedSubmit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 9 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · checkpoint.validateCheckpointSchema (cognitive 36) · ×1
  • checkpoint.validateCheckpointSchema (cognitive 36) packages/arc-agi-3/src/checkpoint.ts:341 — checkpoint.validateCheckpointSchema has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20, boolean chains 16. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · mcp-scan.scanMcp (cognitive 36) · ×1
  • mcp-scan.scanMcp (cognitive 36) REDACTED:48 — mcp-scan.scanMcp has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 8, loops 1 (nesting depth added 10). Of this number, 35 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EvidenceBackedMemory.commit (cognitive 35) · ×1
  • EvidenceBackedMemory.commit (cognitive 35) packages/arc-agi-3/src/memory.ts:254 — EvidenceBackedMemory.commit has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 18, if/else 14 (15 pts), loops 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · subcommands.doctor (cognitive 35) · ×1
  • subcommands.doctor (cognitive 35) packages/create-agent-harness/src/subcommands.ts:84 — subcommands.doctor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 10, error handling 4 (8 pts), ternaries 1 (nesting depth added 7). Of this number, 33 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · metric.analyzeTranscript (cognitive 35) · ×1
  • metric.analyzeTranscript (cognitive 35) packages/darwin-mode/src/gepa/metric.ts:56 — metric.analyzeTranscript has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 3, 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.
D2 · Cognitive Complexity · evaluator.makeToolcallEvaluator.evaluate (cognitive 35) · ×1
  • evaluator.makeToolcallEvaluator.evaluate (cognitive 35) packages/evals-toolcall/src/evaluator.ts:51 — evaluator.makeToolcallEvaluator.evaluate has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 4 (10 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · operator.snapshotAgentJson (cognitive 34) · ×1
  • operator.snapshotAgentJson (cognitive 34) REDACTED:214 — operator.snapshotAgentJson has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · upgrade.applyPlan (cognitive 34) · ×1
  • upgrade.applyPlan (cognitive 34) packages/create-agent-harness/src/upgrade.ts:161 — upgrade.applyPlan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, loops 5, ternaries 1 (4 pts), 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.
D2 · Cognitive Complexity · session.parseLog (cognitive 34) · ×1
  • session.parseLog (cognitive 34) packages/kernel-js/src/session.ts:149 — session.parseLog has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generated-runtime.integrateGeneratedRuntime (cognitive 33) · ×1
  • generated-runtime.integrateGeneratedRuntime (cognitive 33) packages/create-agent-harness/src/generated-runtime.ts:6 — generated-runtime.integrateGeneratedRuntime has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 17). Of this number, 31 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · normalizer.canonValue (cognitive 33) · ×1
  • normalizer.canonValue (cognitive 33) packages/evals-extract/src/normalizer.ts:91 — normalizer.canonValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 4 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · analyze4.main (cognitive 33) · ×1
  • analyze4.main (cognitive 33) docs/research/retort-placement/analyze4.py:104 — analyze4.main has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 8 (14 pts), loops 7 (9 pts), if/else 5 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli.dispatch (cognitive 32) · ×1
  • cli.dispatch (cognitive 32) packages/avo/src/cli.ts:45 — cli.dispatch has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 6 (12 pts), error handling 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · agentic.runRepo (cognitive 32) · ×1
  • agentic.runRepo (cognitive 32) packages/darwin-mode/src/security/agentic.ts:102 — agentic.runRepo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (14 pts), loops 2 (3 pts), boolean chains 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.
D2 · Cognitive Complexity · production-gate.createProductionManifest (cognitive 32) · ×1
  • production-gate.createProductionManifest (cognitive 32) packages/flywheel/src/production-gate.ts:90 — production-gate.createProductionManifest has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 3 (nesting depth added 5). Of this number, 26 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · reward-hack.detectRewardHack (cognitive 32) · ×1
  • reward-hack.detectRewardHack (cognitive 32) packages/weight-eft/src/reward-hack.ts:170 — reward-hack.detectRewardHack has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · export.exportTrainingData (cognitive 32) · ×1
  • export.exportTrainingData (cognitive 32) packages/weight-eft/src/export.ts:135 — export.exportTrainingData has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 6, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 31 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcEpisodeStore.resumePersisted (cognitive 31) · ×1
  • ArcEpisodeStore.resumePersisted (cognitive 31) packages/arc-agi-3-chatgpt/src/store.ts:920 — ArcEpisodeStore.resumePersisted has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 3 (5 pts) (nesting depth added 10). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 939, 991). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · ArcAvoLoop.#persistRuleEvidence (cognitive 31) · ×1
  • ArcAvoLoop.#persistRuleEvidence (cognitive 31) packages/arc-agi-3/src/avo-loop.ts:491 — ArcAvoLoop.#persistRuleEvidence has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 6 (8 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · analyze3.main (cognitive 31) · ×1
  • analyze3.main (cognitive 31) docs/research/retort-placement/analyze3.py:84 — analyze3.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 8 (10 pts), ternaries 4 (8 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.
D2 · Cognitive Complexity · cli.parseArguments (cognitive 30) · ×1
  • cli.parseArguments (cognitive 30) packages/arc-agi-3-bench/src/cli.ts:45 — cli.parseArguments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 6, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · canonical.containsRawGameIdentityKey (cognitive 30) · ×1
  • canonical.containsRawGameIdentityKey (cognitive 30) packages/arc-agi-3/src/canonical.ts:361 — canonical.containsRawGameIdentityKey has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · checkpoint.assertJsonPayload (cognitive 30) · ×1
  • checkpoint.assertJsonPayload (cognitive 30) packages/arc-agi-3/src/checkpoint.ts:262 — checkpoint.assertJsonPayload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · analyze-repo.analyzeRepoCmd (cognitive 30) · ×1
  • analyze-repo.analyzeRepoCmd (cognitive 30) packages/create-agent-harness/src/analyze-repo.ts:364 — analyze-repo.analyzeRepoCmd has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10, loops 2 (3 pts), 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.
D2 · Cognitive Complexity · compare-cmd.formatReport (cognitive 30) · ×1
  • compare-cmd.formatReport (cognitive 30) packages/create-agent-harness/src/compare-cmd.ts:142 — compare-cmd.formatReport has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 4, 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.
D2 · Cognitive Complexity · loader.parseYaml (cognitive 30) · ×1
  • loader.parseYaml (cognitive 30) packages/redblue/src/config/loader.ts:77 — loader.parseYaml has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). Of this number, 21 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · canonical.snapshotArcJson · ×1
  • canonical.snapshotArcJson::clone (cognitive 29) packages/arc-agi-3/src/canonical.ts:180 — canonical.snapshotArcJson::clone has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · meta-proxy-service.parseManagerState (cognitive 29) · ×1
  • meta-proxy-service.parseManagerState (cognitive 29) packages/create-agent-harness/src/meta-proxy-service.ts:302 — meta-proxy-service.parseManagerState has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8 (11 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · safety.inspectVariant (cognitive 29) · ×1
  • safety.inspectVariant (cognitive 29) packages/darwin-mode/src/safety.ts:133 — safety.inspectVariant has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 pts), error handling 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · clade.cladeOutcomesAll (cognitive 29) · ×1
  • clade.cladeOutcomesAll (cognitive 29) packages/darwin-mode/src/clade.ts:104 — clade.cladeOutcomesAll has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (6 pts) (nesting depth added 13). Of this number, 18 points are the body's own statements and 11 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · validation.snapshot · ×1
  • validation.snapshot::visit (cognitive 29) packages/darwin-mode/src/contrastive/validation.ts:32 — validation.snapshot::visit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FieldMemory.update (cognitive 29) · ×1
  • FieldMemory.update (cognitive 29) packages/field-memory/src/field-memory.ts:788 — FieldMemory.update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 5, ternaries 2, error handling 1, loops 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 834, 964). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · HackerOneClient.weaknessesFull (cognitive 29) · ×1
  • HackerOneClient.weaknessesFull (cognitive 29) packages/redblue/src/integrations/hackerone.ts:437 — HackerOneClient.weaknessesFull has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcEpisodeStore.resumeAvoPersisted (cognitive 28) · ×1
  • ArcEpisodeStore.resumeAvoPersisted (cognitive 28) packages/arc-agi-3-chatgpt/src/store.ts:1041 — ArcEpisodeStore.resumeAvoPersisted has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), error handling 4 (5 pts) (nesting depth added 7). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1090, a function literal at line 1133, restore, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · server.createArcMcpRuntime.server (cognitive 28) · ×1
  • server.createArcMcpRuntime.server (cognitive 28) REDACTED:403 — server.createArcMcpRuntime.server has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 10 (11 pts), boolean chains 3, error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcAvoLoop.#verifyCheckpointBindings (cognitive 28) · ×1
  • ArcAvoLoop.#verifyCheckpointBindings (cognitive 28) packages/arc-agi-3/src/avo-loop.ts:657 — ArcAvoLoop.#verifyCheckpointBindings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.runMetaHarnessSubcommand (cognitive 28) · ×1
  • index.runMetaHarnessSubcommand (cognitive 28) packages/create-agent-harness/src/index.ts:955 — index.runMetaHarnessSubcommand has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FannSurrogate.fit (cognitive 28) · ×1
  • FannSurrogate.fit (cognitive 28) packages/darwin-mode/src/fann-surrogate.ts:188 — FannSurrogate.fit has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 7 (9 pts), boolean chains 5, error handling 1 (nesting depth added 8). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · protocol.runProtocol · ×1
  • protocol.runProtocol::runExecute (cognitive 28) packages/radio/src/protocol.ts:280 — protocol.runProtocol::runExecute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (7 pts), boolean chains 2, 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. This shape REPEATS in the file: one other method here (protocol.runProtocol) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · protocol.runProtocol (cognitive 28) · ×1
  • protocol.runProtocol (cognitive 28) packages/radio/src/protocol.ts:195 — protocol.runProtocol has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 14 (20 pts), ternaries 9 (12 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (protocol.runProtocol::runExecute) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · claim-gate.parseManifest (cognitive 27) · ×1
  • claim-gate.parseManifest (cognitive 27) packages/avo/src/claim-gate.ts:319 — claim-gate.parseManifest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · meta-proxy.installAndActivateMetaProxy (cognitive 27) · ×1
  • meta-proxy.installAndActivateMetaProxy (cognitive 27) REDACTED:572 — meta-proxy.installAndActivateMetaProxy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (10 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diag.buildSupportBundle (cognitive 27) · ×1
  • diag.buildSupportBundle (cognitive 27) packages/create-agent-harness/src/diag.ts:404 — diag.buildSupportBundle has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (8 pts), error handling 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · federate.federateDispatch (cognitive 27) · ×1
  • federate.federateDispatch (cognitive 27) packages/create-agent-harness/src/federate.ts:83 — federate.federateDispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · oia-manifest.oiaManifestCmd (cognitive 27) · ×1
  • oia-manifest.oiaManifestCmd (cognitive 27) packages/create-agent-harness/src/oia-manifest.ts:237 — oia-manifest.oiaManifestCmd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, error handling 3 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · swarm.runSwarm (cognitive 27) · ×1
  • swarm.runSwarm (cognitive 27) packages/darwin-mode/src/security/swarm.ts:97 — swarm.runSwarm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · loop.gepaOptimize (cognitive 27) · ×1
  • loop.gepaOptimize (cognitive 27) packages/darwin-mode/src/gepa/loop.ts:233 — loop.gepaOptimize has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 6, if/else 3 (6 pts), loops 2 (3 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.
D2 · Cognitive Complexity · LongHorizonDriver.runLoop (cognitive 27) · ×1
  • LongHorizonDriver.runLoop (cognitive 27) packages/horizon/src/driver.ts:149 — LongHorizonDriver.runLoop has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 4 (11 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · model-driver.validateModelTurnResponse (cognitive 26) · ×1
  • model-driver.validateModelTurnResponse (cognitive 26) packages/arc-agi-3-bench/src/model-driver.ts:174 — model-driver.validateModelTurnResponse has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 7 (9 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · official-factory.journalEvidence (cognitive 26) · ×1
  • official-factory.journalEvidence (cognitive 26) packages/arc-agi-3-chatgpt/src/official-factory.ts:506 — official-factory.journalEvidence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · receipts.validateReceiptContinuation (cognitive 26) · ×1
  • receipts.validateReceiptContinuation (cognitive 26) packages/arc-agi-3/src/receipts.ts:359 — receipts.validateReceiptContinuation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · cli.main (cognitive 26) · ×1
  • cli.main (cognitive 26) packages/darwin-mode/src/cli.ts:286 — cli.main has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 13, if/else 7 (8 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · from-mcp-scan.deriveBadgesFromMcpScan (cognitive 25) · ×1
  • from-mcp-scan.deriveBadgesFromMcpScan (cognitive 25) packages/agntcy/src/identity/from-mcp-scan.ts:113 — from-mcp-scan.deriveBadgesFromMcpScan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · canonical.toSafeJson (cognitive 25) · ×1
  • canonical.toSafeJson (cognitive 25) packages/arc-agi-3/src/canonical.ts:315 — canonical.toSafeJson has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EvidenceBackedMemory.query (cognitive 25) · ×1
  • EvidenceBackedMemory.query (cognitive 25) packages/arc-agi-3/src/memory.ts:373 — EvidenceBackedMemory.query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, ternaries 2 (nesting depth added 5). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 388). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · wizard.runWizard (cognitive 25) · ×1
  • wizard.runWizard (cognitive 25) packages/create-agent-harness/src/wizard.ts:72 — wizard.runWizard has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 3, ternaries 1 (nesting depth added 10). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizer.extractJsonObject (cognitive 25) · ×1
  • normalizer.extractJsonObject (cognitive 25) packages/evals-toolcall/src/normalizer.ts:75 — normalizer.extractJsonObject has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizer.canonValue (cognitive 25) · ×1
  • normalizer.canonValue (cognitive 25) packages/evals-toolcall/src/normalizer.ts:139 — normalizer.canonValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · bridge._grid_frame (cognitive 25) · ×1
  • bridge._grid_frame (cognitive 25) packages/arc-agi-3/python/bridge.py:312 — bridge._grid_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · startMcp · ×1
  • startMcp::handle (cognitive 25) packages/create-agent-harness/assets/generated-mcp.mjs:15 — startMcp::handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, ternaries 2 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · model-driver.assertPlainJson (cognitive 24) · ×1
  • model-driver.assertPlainJson (cognitive 24) packages/arc-agi-3-bench/src/model-driver.ts:83 — model-driver.assertPlainJson has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · supervisor.detect (cognitive 24) · ×1
  • supervisor.detect (cognitive 24) packages/arc-agi-3/src/supervisor.ts:66 — supervisor.detect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, ternaries 8 (9 pts), boolean chains 5, loops 1 (nesting depth added 1). Of this number, 22 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ArcController.actCriticalSection (cognitive 24) · ×1
  • ArcController.actCriticalSection (cognitive 24) packages/arc-agi-3/src/controller.ts:904 — ArcController.actCriticalSection has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (7 pts), error handling 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcController.commitDirectiveCriticalSection (cognitive 24) · ×1
  • ArcController.commitDirectiveCriticalSection (cognitive 24) packages/arc-agi-3/src/controller.ts:1223 — ArcController.commitDirectiveCriticalSection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 3 (4 pts), error handling 1 (nesting depth added 5). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · field-memory-scaffold.integrateFieldMemory (cognitive 24) · ×1
  • field-memory-scaffold.integrateFieldMemory (cognitive 24) packages/create-agent-harness/src/field-memory-scaffold.ts:70 — field-memory-scaffold.integrateFieldMemory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 6). Of this number, 22 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · validate.runPathGuard · ×1
  • validate.runPathGuard::walk (cognitive 24) packages/create-agent-harness/src/validate.ts:65 — validate.runPathGuard::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · validation.validateDocument (cognitive 24) · ×1
  • validation.validateDocument (cognitive 24) packages/darwin-mode/src/contrastive/validation.ts:78 — validation.validateDocument has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 2 (nesting depth added 6). Of this number, 21 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizer.parseKeywordArgs (cognitive 24) · ×1
  • normalizer.parseKeywordArgs (cognitive 24) packages/evals-toolcall/src/normalizer.ts:103 — normalizer.parseKeywordArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · production-gate.validateProductionManifest (cognitive 24) · ×1
  • production-gate.validateProductionManifest (cognitive 24) packages/flywheel/src/production-gate.ts:186 — production-gate.validateProductionManifest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · chatCompletions.streamResponse (cognitive 24) · ×1
  • chatCompletions.streamResponse (cognitive 24) REDACTED:219 — chatCompletions.streamResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 8). Of this number, 22 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bridge._observation (cognitive 24) · ×1
  • bridge._observation (cognitive 24) packages/arc-agi-3/python/bridge.py:356 — bridge._observation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 2, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · scaffold.hostFiles (cognitive 23) · ×1
  • scaffold.hostFiles (cognitive 23) apps/web-ui/src/generator/scaffold.ts:275 — scaffold.hostFiles has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 3, if/else 1 (2 pts), match/switch 1 (nesting depth added 10). Of this number, 16 points are the body's own statements and 7 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · EvidenceBackedMemory.load (cognitive 23) · ×1
  • EvidenceBackedMemory.load (cognitive 23) packages/arc-agi-3/src/memory.ts:413 — EvidenceBackedMemory.load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 2 (3 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.
D2 · Cognitive Complexity · ArcController.resume (cognitive 23) · ×1
  • ArcController.resume (cognitive 23) packages/arc-agi-3/src/controller.ts:703 — ArcController.resume has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, error handling 3, loops 2 (nesting depth added 1). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 704). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · ArcPlanArchive.select (cognitive 23) · ×1
  • ArcPlanArchive.select (cognitive 23) packages/arc-agi-3/src/plan-archive.ts:551 — ArcPlanArchive.select has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 6, boolean chains 4, loops 2 (nesting depth added 5). Of this number, 18 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cascade.runCascade (cognitive 23) · ×1
  • cascade.runCascade (cognitive 23) packages/aws-finops/src/cascade.ts:78 — cascade.runCascade has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · upgrade-cmd.upgradeCmd (cognitive 23) · ×1
  • upgrade-cmd.upgradeCmd (cognitive 23) packages/create-agent-harness/src/upgrade-cmd.ts:45 — upgrade-cmd.upgradeCmd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 4 (6 pts), error handling 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · index.installMd (cognitive 23) · ×1
  • index.installMd (cognitive 23) packages/host-prime-agent/src/index.ts:343 — index.installMd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (23 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · make-scaffold-chart.curveSvg (cognitive 22) · ×1
  • make-scaffold-chart.curveSvg (cognitive 22) docs/research/scaffolding/make-scaffold-chart.mjs:64 — make-scaffold-chart.curveSvg has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 2 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 20 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · project.projectToOasf (cognitive 22) · ×1
  • project.projectToOasf (cognitive 22) packages/agntcy/src/oasf/project.ts:190 — project.projectToOasf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · auth.authenticate (cognitive 22) · ×1
  • auth.authenticate (cognitive 22) packages/arc-agi-3-chatgpt/src/auth.ts:239 — auth.authenticate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · claim-gate.evaluateReleaseClaimGate (cognitive 22) · ×1
  • claim-gate.evaluateReleaseClaimGate (cognitive 22) packages/avo/src/claim-gate.ts:674 — claim-gate.evaluateReleaseClaimGate has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, ternaries 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.
D2 · Cognitive Complexity · host-config.hostConfigFiles (cognitive 22) · ×1
  • host-config.hostConfigFiles (cognitive 22) packages/create-agent-harness/src/host-config.ts:109 — host-config.hostConfigFiles has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 11). Of this number, 15 points are the body's own statements and 7 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · repo_profiler.resolveTooling (cognitive 22) · ×1
  • repo_profiler.resolveTooling (cognitive 22) packages/darwin-mode/src/repo_profiler.ts:70 — repo_profiler.resolveTooling has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SemgrepDetectorOracle.run (cognitive 22) · ×1
  • SemgrepDetectorOracle.run (cognitive 22) packages/darwin-mode/src/security/semgrep-oracle.ts:105 — SemgrepDetectorOracle.run has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 10). Of this number, 20 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FileBudgetLimiter.readState (cognitive 22) · ×1
  • FileBudgetLimiter.readState (cognitive 22) packages/flywheel/src/budget.ts:297 — FileBudgetLimiter.readState has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · taint.taintScan (cognitive 22) · ×1
  • taint.taintScan (cognitive 22) packages/projects/src/taint.ts:161 — taint.taintScan has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · mock-target.exampleAgentTarget (cognitive 22) · ×1
  • mock-target.exampleAgentTarget (cognitive 22) packages/redblue/src/mock-target.ts:47 — mock-target.exampleAgentTarget has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7 (nesting depth added 4). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 48). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · HackerOneClient.programScope (cognitive 22) · ×1
  • HackerOneClient.programScope (cognitive 22) packages/redblue/src/integrations/hackerone.ts:626 — HackerOneClient.programScope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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.
D2 · Cognitive Complexity · index.cmdHackerOne (cognitive 22) · ×1
  • index.cmdHackerOne (cognitive 22) packages/redblue/src/cli/index.ts:300 — index.cmdHackerOne has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (7 pts), loops 2 (4 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.
D2 · Cognitive Complexity · inflight.streamInflight (cognitive 22) · ×1
  • inflight.streamInflight (cognitive 22) services/apicompletions/src/midstream/inflight.ts:133 — inflight.streamInflight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 7). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · make-charts.chart7 (cognitive 21) · ×1
  • make-charts.chart7 (cognitive 21) docs/research/cheap-vs-frontier/make-charts.mjs:260 — make-charts.chart7 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 4 (5 pts), boolean chains 3, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rvf-cow-bench.main (cognitive 21) · ×1
  • rvf-cow-bench.main (cognitive 21) docs/research/ruvector-applications/rvf-cow-bench.js:62 — rvf-cow-bench.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 3 (7 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RepositoryEnvironmentAdapter.execute (cognitive 21) · ×1
  • RepositoryEnvironmentAdapter.execute (cognitive 21) packages/avo/src/repository.ts:60 — RepositoryEnvironmentAdapter.execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · confirmation.confirmContrastive (cognitive 21) · ×1
  • confirmation.confirmContrastive (cognitive 21) packages/darwin-mode/src/contrastive/confirmation.ts:72 — confirmation.confirmContrastive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 10, ternaries 5 (8 pts), error handling 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive::execute) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · normalizer.parseCall (cognitive 21) · ×1
  • normalizer.parseCall (cognitive 21) packages/evals-toolcall/src/normalizer.ts:46 — normalizer.parseCall has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), error handling 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.
D2 · Cognitive Complexity · chatCompletions.makeChatCompletions.postChatCompletions (cognitive 21) · ×1
  • chatCompletions.makeChatCompletions.postChatCompletions (cognitive 21) REDACTED:65 — chatCompletions.makeChatCompletions.postChatCompletions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (7 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.
D2 · Cognitive Complexity · messages.makeMessages.postMessages (cognitive 21) · ×1
  • messages.makeMessages.postMessages (cognitive 21) REDACTED:74 — messages.makeMessages.postMessages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (7 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.
D2 · Cognitive Complexity · analyze2.main (cognitive 21) · ×1
  • analyze2.main (cognitive 21) docs/research/retort-placement/analyze2.py:64 — analyze2.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · avo-config.resolveFeatures (cognitive 20) · ×1
  • avo-config.resolveFeatures (cognitive 20) packages/arc-agi-3/src/avo-config.ts:116 — avo-config.resolveFeatures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · claim-gate.validateClaimSurfaces (cognitive 20) · ×1
  • claim-gate.validateClaimSurfaces (cognitive 20) packages/avo/src/claim-gate.ts:383 — claim-gate.validateClaimSurfaces has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · claim-gate.preregistrationValid (cognitive 20) · ×1
  • claim-gate.preregistrationValid (cognitive 20) packages/avo/src/claim-gate.ts:462 — claim-gate.preregistrationValid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, 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.
D2 · Cognitive Complexity · score.scoreMcpSafety (cognitive 20) · ×1
  • score.scoreMcpSafety (cognitive 20) packages/create-agent-harness/src/score.ts:174 — score.scoreMcpSafety has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · confirmation.confirmContrastive · ×1
  • confirmation.confirmContrastive::execute (cognitive 20) packages/darwin-mode/src/contrastive/confirmation.ts:117 — confirmation.confirmContrastive::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, ternaries 2 (4 pts), error handling 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · evaluator.makeExtractEvaluator.evaluate (cognitive 20) · ×1
  • evaluator.makeExtractEvaluator.evaluate (cognitive 20) packages/evals-extract/src/evaluator.ts:53 — evaluator.makeExtractEvaluator.evaluate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · classifier.heuristicClassifier (cognitive 20) · ×1
  • classifier.heuristicClassifier (cognitive 20) packages/evals-hle/src/classifier.ts:21 — classifier.heuristicClassifier has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FieldMemory.importState (cognitive 20) · ×1
  • FieldMemory.importState (cognitive 20) packages/field-memory/src/field-memory.ts:1220 — FieldMemory.importState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · RuVectorFieldStorage.constructor (cognitive 20) · ×1
  • RuVectorFieldStorage.constructor (cognitive 20) packages/field-memory/src/ruvector-storage.ts:68 — RuVectorFieldStorage.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · cli.trainCmd (cognitive 20) · ×1
  • cli.trainCmd (cognitive 20) packages/weight-eft/src/cli.ts:87 — cli.trainCmd has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HarnessBuilder.HarnessBuilder (cognitive 19) · ×1
  • HarnessBuilder.HarnessBuilder (cognitive 19) apps/web-ui/src/components/HarnessBuilder.tsx:47 — HarnessBuilder.HarnessBuilder has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, boolean chains 7, if/else 1. Of this number, 15 points are the body's own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · RepoImporter.RepoImporter (cognitive 19) · ×1
  • RepoImporter.RepoImporter (cognitive 19) apps/web-ui/src/components/RepoImporter.tsx:44 — RepoImporter.RepoImporter has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 6, if/else 4, error handling 2 (nesting depth added 2). Of this number, 10 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · official-factory.scorecardRuns (cognitive 19) · ×1
  • official-factory.scorecardRuns (cognitive 19) packages/arc-agi-3-chatgpt/src/official-factory.ts:459 — official-factory.scorecardRuns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 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.
D2 · Cognitive Complexity · EvidenceRetrodictiveWorldModel.load (cognitive 19) · ×1
  • EvidenceRetrodictiveWorldModel.load (cognitive 19) packages/arc-agi-3/src/world-model.ts:163 — EvidenceRetrodictiveWorldModel.load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SemanticSupervisor.observe (cognitive 19) · ×1
  • SemanticSupervisor.observe (cognitive 19) packages/avo/src/supervisor.ts:47 — SemanticSupervisor.observe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2, ternaries 2 (nesting depth added 3). Of this number, 17 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · secrets.check (cognitive 19) · ×1
  • secrets.check (cognitive 19) REDACTED:87 — secrets.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · mcp-cmd.mcpLs (cognitive 19) · ×1
  • mcp-cmd.mcpLs (cognitive 19) packages/create-agent-harness/src/mcp-cmd.ts:60 — mcp-cmd.mcpLs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · evaluator.makeHleEvaluator.evaluate (cognitive 19) · ×1
  • evaluator.makeHleEvaluator.evaluate (cognitive 19) packages/evals-hle/src/evaluator.ts:52 — evaluator.makeHleEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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.
D2 · Cognitive Complexity · evaluator.makeMathEvaluator.evaluate (cognitive 19) · ×1
  • evaluator.makeMathEvaluator.evaluate (cognitive 19) packages/evals-math/src/evaluator.ts:52 — evaluator.makeMathEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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.
D2 · Cognitive Complexity · evaluator.makeSqlEvaluator.evaluate (cognitive 19) · ×1
  • evaluator.makeSqlEvaluator.evaluate (cognitive 19) packages/evals-sql/src/evaluator.ts:54 — evaluator.makeSqlEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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.
D2 · Cognitive Complexity · Agent.manifest (cognitive 19) · ×1
  • Agent.manifest (cognitive 19) packages/oo-agents/src/agent.ts:89 — Agent.manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim.makeTask (cognitive 19) · ×1
  • sim.makeTask (cognitive 19) packages/radio/src/sim.ts:369 — sim.makeTask has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · verify.mcpServerPresent (cognitive 18) · ×1
  • verify.mcpServerPresent (cognitive 18) apps/web-ui/src/generator/verify.ts:33 — verify.mcpServerPresent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compile.compileObjectiveToEnvelope (cognitive 18) · ×1
  • compile.compileObjectiveToEnvelope (cognitive 18) packages/agntcy/src/casa/compile.ts:159 — compile.compileObjectiveToEnvelope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · stats.signFlipPValue (cognitive 18) · ×1
  • stats.signFlipPValue (cognitive 18) packages/arc-agi-3-bench/src/stats.ts:122 — stats.signFlipPValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tools.registerActorTools (cognitive 18) · ×1
  • tools.registerActorTools (cognitive 18) packages/arc-agi-3-chatgpt/src/tools.ts:320 — tools.registerActorTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (6 pts), ternaries 3 (nesting depth added 7). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 500, 327, 402, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · memory.validateStoredRule (cognitive 18) · ×1
  • memory.validateStoredRule (cognitive 18) packages/arc-agi-3/src/memory.ts:150 — memory.validateStoredRule has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · checkpoint.validateCheckpointBeliefHistory (cognitive 18) · ×1
  • checkpoint.validateCheckpointBeliefHistory (cognitive 18) packages/arc-agi-3/src/checkpoint.ts:881 — checkpoint.validateCheckpointBeliefHistory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gen-templates.uiCatalogTs (cognitive 18) · ×1
  • gen-templates.uiCatalogTs (cognitive 18) packages/create-agent-harness/scripts/gen-templates.mjs:292 — gen-templates.uiCatalogTs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 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.
D2 · Cognitive Complexity · analyze-repo.analyzeFiles (cognitive 18) · ×1
  • analyze-repo.analyzeFiles (cognitive 18) packages/create-agent-harness/src/analyze-repo.ts:162 — analyze-repo.analyzeFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · witness-client.verifyWitness (cognitive 18) · ×1
  • witness-client.verifyWitness (cognitive 18) packages/create-agent-harness/src/witness-client.ts:52 — witness-client.verifyWitness has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · sbom-cmd.packagesFromLock (cognitive 18) · ×1
  • sbom-cmd.packagesFromLock (cognitive 18) packages/create-agent-harness/src/sbom-cmd.ts:38 — sbom-cmd.packagesFromLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · classifier.heuristicClassifier (cognitive 18) · ×1
  • classifier.heuristicClassifier (cognitive 18) packages/evals-extract/src/classifier.ts:21 — classifier.heuristicClassifier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizer.normalizeAnswer (cognitive 18) · ×1
  • normalizer.normalizeAnswer (cognitive 18) packages/evals-math/src/normalizer.ts:23 — normalizer.normalizeAnswer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · verifier.makeVerifier.verify (cognitive 18) · ×1
  • verifier.makeVerifier.verify (cognitive 18) packages/evals-sql/src/verifier.ts:34 — verifier.makeVerifier.verify has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5, 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.
D2 · Cognitive Complexity · production-gate.productionDecision (cognitive 18) · ×1
  • production-gate.productionDecision (cognitive 18) packages/flywheel/src/production-gate.ts:163 — production-gate.productionDecision has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 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.
D2 · Cognitive Complexity · cli.reportCmd (cognitive 18) · ×1
  • cli.reportCmd (cognitive 18) packages/turn-credit/src/cli.ts:78 — cli.reportCmd has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (13 pts), loops 2 (3 pts), if/else 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.validateVerticalManifest (cognitive 18) · ×1
  • index.validateVerticalManifest (cognitive 18) packages/vertical-base/src/index.ts:69 — index.validateVerticalManifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 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.
D2 · Cognitive Complexity · safety.detectConcepts (cognitive 18) · ×1
  • safety.detectConcepts (cognitive 18) packages/workspace-lens/src/safety.ts:51 — safety.detectConcepts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), ternaries 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.
D2 · Cognitive Complexity · make-charts.chart6 (cognitive 17) · ×1
  • make-charts.chart6 (cognitive 17) docs/research/cheap-vs-frontier/make-charts.mjs:162 — make-charts.chart6 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (5 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.window.addEventListener("message") (cognitive 17) · ×1
  • REDACTED.window.addEventListener("message") (cognitive 17) REDACTED:167 — REDACTED.window.addEventListener("message") has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · canonical.validateFrame (cognitive 17) · ×1
  • canonical.validateFrame (cognitive 17) packages/arc-agi-3/src/canonical.ts:422 — canonical.validateFrame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 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.
D2 · Cognitive Complexity · canonical.validateExactArcObservation (cognitive 17) · ×1
  • canonical.validateExactArcObservation (cognitive 17) packages/arc-agi-3/src/canonical.ts:617 — canonical.validateExactArcObservation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · BeliefGraph.componentSize (cognitive 17) · ×1
  • BeliefGraph.componentSize (cognitive 17) packages/arc-agi-3/src/belief-graph.ts:402 — BeliefGraph.componentSize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (8 pts) (nesting depth added 7). Of this number, 12 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PythonArcBridge.#onStdout (cognitive 17) · ×1
  • PythonArcBridge.#onStdout (cognitive 17) packages/arc-agi-3/src/python-bridge.ts:768 — PythonArcBridge.#onStdout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PythonArcBridge.#disposeAfterQueue (cognitive 17) · ×1
  • PythonArcBridge.#disposeAfterQueue (cognitive 17) packages/arc-agi-3/src/python-bridge.ts:891 — PythonArcBridge.#disposeAfterQueue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · analyze-repo.inventory (cognitive 17) · ×1
  • analyze-repo.inventory (cognitive 17) packages/create-agent-harness/src/analyze-repo.ts:121 — analyze-repo.inventory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · validate.runMcpCheck (cognitive 17) · ×1
  • validate.runMcpCheck (cognitive 17) packages/create-agent-harness/src/validate.ts:99 — validate.runMcpCheck has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (7 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plugin-init-cmd.pluginInitCmd (cognitive 17) · ×1
  • plugin-init-cmd.pluginInitCmd (cognitive 17) packages/create-agent-harness/src/plugin-init-cmd.ts:75 — plugin-init-cmd.pluginInitCmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · scorer.scoreVariant (cognitive 17) · ×1
  • scorer.scoreVariant (cognitive 17) packages/darwin-mode/src/scorer.ts:113 — scorer.scoreVariant has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · real-evolve.evolveDetectorsReal · ×1
  • real-evolve.evolveDetectorsReal::score (cognitive 17) packages/darwin-mode/src/security/real-evolve.ts:129 — real-evolve.evolveDetectorsReal::score has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · metric.classifyFailure (cognitive 17) · ×1
  • metric.classifyFailure (cognitive 17) packages/darwin-mode/src/gepa/metric.ts:194 — metric.classifyFailure has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · field-memory.rebuildPublishedEmbedding (cognitive 17) · ×1
  • field-memory.rebuildPublishedEmbedding (cognitive 17) packages/field-memory/src/field-memory.ts:209 — field-memory.rebuildPublishedEmbedding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · validate-bundle.validateLineageCommit (cognitive 17) · ×1
  • validate-bundle.validateLineageCommit (cognitive 17) packages/flywheel/src/validate-bundle.ts:55 — validate-bundle.validateLineageCommit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · review-context.verifyIndependentReviewPacket (cognitive 17) · ×1
  • review-context.verifyIndependentReviewPacket (cognitive 17) packages/flywheel/src/review-context.ts:279 — review-context.verifyIndependentReviewPacket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), loops 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · discovery.runDiscovery (cognitive 17) · ×1
  • discovery.runDiscovery (cognitive 17) packages/projects/src/discovery.ts:114 — discovery.runDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, boolean chains 1, ternaries 1 (nesting depth added 5). Of this number, 13 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · mock-target.alwaysVulnerableFixture (cognitive 17) · ×1
  • mock-target.alwaysVulnerableFixture (cognitive 17) packages/redblue/src/mock-target.ts:210 — mock-target.alwaysVulnerableFixture has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 211). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · report.renderMarkdown (cognitive 17) · ×1
  • report.renderMarkdown (cognitive 17) packages/redblue/src/reports/report.ts:81 — report.renderMarkdown has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 2 (4 pts), if/else 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · completions.makeCompletions.postCompletions (cognitive 17) · ×1
  • completions.makeCompletions.postCompletions (cognitive 17) REDACTED:35 — completions.makeCompletions.postCompletions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (5 pts), boolean chains 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.
D2 · Cognitive Complexity · bridge.main (cognitive 17) · ×1
  • bridge.main (cognitive 17) packages/arc-agi-3/python/bridge.py:810 — bridge.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · repo.analyzeFiles (cognitive 16) · ×1
  • repo.analyzeFiles (cognitive 16) apps/web-ui/src/generator/repo.ts:231 — repo.analyzeFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · BenchmarkPlanner.propose (cognitive 16) · ×1
  • BenchmarkPlanner.propose (cognitive 16) packages/arc-agi-3-bench/src/bench-planner.ts:37 — BenchmarkPlanner.propose has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), boolean chains 5, if/else 5 (nesting depth added 1). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · runner.runEpisode (cognitive 16) · ×1
  • runner.runEpisode (cognitive 16) packages/arc-agi-3-bench/src/runner.ts:80 — runner.runEpisode has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (6 pts), if/else 3 (5 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArcController.assertActionLegalAgainst (cognitive 16) · ×1
  • ArcController.assertActionLegalAgainst (cognitive 16) packages/arc-agi-3/src/controller.ts:1087 — ArcController.assertActionLegalAgainst has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · meta-proxy.uninstallMetaProxy (cognitive 16) · ×1
  • meta-proxy.uninstallMetaProxy (cognitive 16) REDACTED:220 — meta-proxy.uninstallMetaProxy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · meta-proxy.replaceEffectiveMetaProxy (cognitive 16) · ×1
  • meta-proxy.replaceEffectiveMetaProxy (cognitive 16) REDACTED:544 — meta-proxy.replaceEffectiveMetaProxy has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (5 pts), if/else 3 (5 pts), boolean chains 3, 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.
D2 · Cognitive Complexity · evolve.evolve (cognitive 16) · ×1
  • evolve.evolve (cognitive 16) packages/darwin-mode/src/security/evolve.ts:72 — evolve.evolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizer.extractJsonSpan (cognitive 16) · ×1
  • normalizer.extractJsonSpan (cognitive 16) packages/evals-extract/src/normalizer.ts:29 — normalizer.extractJsonSpan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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.
D2 · Cognitive Complexity · field-memory.countScalars (cognitive 16) · ×1
  • field-memory.countScalars (cognitive 16) packages/field-memory/src/field-memory.ts:396 — field-memory.countScalars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.cliConfigYaml (cognitive 16) · ×1
  • index.cliConfigYaml (cognitive 16) packages/host-hermes/src/index.ts:131 — index.cliConfigYaml has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (11 pts), loops 2 (3 pts), if/else 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.
D2 · Cognitive Complexity · capability.probe (cognitive 16) · ×1
  • capability.probe (cognitive 16) packages/jujutsu/src/capability.ts:61 — capability.probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · memory-rvf.createRvfBackend.insertBatch (cognitive 16) · ×1
  • memory-rvf.createRvfBackend.insertBatch (cognitive 16) packages/kernel-js/src/memory-rvf.ts:362 — memory-rvf.createRvfBackend.insertBatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). Of this number, 9 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · judge.extractJson (cognitive 16) · ×1
  • judge.extractJson (cognitive 16) packages/redblue/src/judges/judge.ts:33 — judge.extractJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HackerOneClient.probeWriteScope (cognitive 16) · ×1
  • HackerOneClient.probeWriteScope (cognitive 16) packages/redblue/src/integrations/hackerone.ts:693 — HackerOneClient.probeWriteScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · train.solve (cognitive 16) · ×1
  • train.solve (cognitive 16) packages/router/src/train.ts:13 — train.solve has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 8). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (3 members, 23 shared lines) · ×1
  • Near-duplicate member family (3 members, 23 shared lines) docs/research/retort-placement/analyze2.py:65 — docs/research/retort-placement/analyze2.py:65-162 | docs/research/retort-placement/analyze3.py:85-185 | docs/research/retort-placement/analyze4.py:105-195 — These 3 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times.
D4 · Code Duplication · Edited copy of a member (40 corresponding lines) · ×1
  • Edited copy of a member (40 corresponding lines) packages/horizon/crate/src/lib.rs:97 — packages/horizon/crate/src/lib.rs:97-136 | packages/oo-agents/crate/src/lib.rs:61-114 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) kimi-k3-harness/crates/k3rs/src/avx2.rs:70 — kimi-k3-harness/crates/k3rs/src/avx2.rs:70-91 | kimi-k3-harness/crates/k3rs/src/avx2.rs:96-121 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) docs/research/retort-placement/analyze3.py:68 — docs/research/retort-placement/analyze3.py:68-81 | docs/research/retort-placement/analyze4.py:70-83 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 11+ corresponding lines) docs/research/retort-placement/harvest2.py:52 — docs/research/retort-placement/harvest2.py:52-62 | docs/research/retort-placement/harvest3.py:56-72 | docs/research/retort-placement/harvest4.py:58-74 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 24+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 24+ corresponding lines) docs/research/retort-placement/harvest2.py:25 — docs/research/retort-placement/harvest2.py:25-48 | docs/research/retort-placement/harvest3.py:25-52 | docs/research/retort-placement/harvest4.py:25-54 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs:69 — kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs:69-89 | kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs:125-143 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 5+ corresponding lines) docs/research/retort-placement/analyze2.py:30 — docs/research/retort-placement/analyze2.py:30-34 | docs/research/retort-placement/analyze3.py:33-37 | docs/research/retort-placement/analyze4.py:35-39 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 3+ corresponding lines) docs/research/retort-placement/analyze2.py:51 — docs/research/retort-placement/analyze2.py:51-53 | docs/research/retort-placement/analyze3.py:54-56 | docs/research/retort-placement/analyze4.py:56-58 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×1
  • Edited copy of a member (8 corresponding lines) crates/kernel-napi/src/lib.rs:13 — crates/kernel-napi/src/lib.rs:13-20 | crates/kernel-wasm/src/lib.rs:16-23 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) crates/kernel-wasm/src/lib.rs:38 — crates/kernel-wasm/src/lib.rs:38-43 | crates/kernel-wasm/src/lib.rs:57-63 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (3–10 lines × 3) · ×1
  • Duplicated block (3–10 lines × 3) docs/research/retort-placement/analyze2.py:123 — docs/research/retort-placement/analyze2.py:123-132 | docs/research/retort-placement/analyze3.py:152-161 | docs/research/retort-placement/analyze4.py:169-171 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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 `docs/research/retort-placement/analyze4.py:169` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `docs/research/retort-placement/analyze2.py:121` calls `list`, `is_dominated` and `docs/research/retort-placement/analyze4.py:168` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) docs/research/retort-placement/analyze2.py:39 — docs/research/retort-placement/analyze2.py:39-47 | docs/research/retort-placement/analyze3.py:42-50 | docs/research/retort-placement/analyze4.py:44-52 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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.
D4 · Code Duplication · Duplicated block (7–8 lines × 3) · ×1
  • Duplicated block (7–8 lines × 3) docs/research/retort-placement/analyze2.py:74 — docs/research/retort-placement/analyze2.py:74-81 | docs/research/retort-placement/analyze3.py:93-99 | docs/research/retort-placement/analyze4.py:113-119 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) docs/research/retort-placement/analyze2.py:106 — docs/research/retort-placement/analyze2.py:106-118 | docs/research/retort-placement/analyze3.py:135-147 | docs/research/retort-placement/analyze4.py:154-166 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×1
  • Duplicated block (10 lines × 3) docs/research/retort-placement/analyze2.py:144 — docs/research/retort-placement/analyze2.py:144-153 | docs/research/retort-placement/analyze3.py:72-81 | docs/research/retort-placement/analyze4.py:74-83 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) docs/research/retort-placement/harvest2.py:25 — docs/research/retort-placement/harvest2.py:25-35 | docs/research/retort-placement/harvest3.py:25-35 | docs/research/retort-placement/harvest4.py:25-35 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `docs/research/retort-placement/harvest3.py:36` calls `get` and `docs/research/retort-placement/harvest2.py:36` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) docs/research/retort-placement/analyze2.py:57 — docs/research/retort-placement/analyze2.py:57-61 | docs/research/retort-placement/analyze3.py:60-64 | docs/research/retort-placement/analyze4.py:62-66 — before extracting anything, compare `docs/research/retort-placement/analyze2.py` and `docs/research/retort-placement/analyze3.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) docs/research/retort-placement/harvest2.py:56 — docs/research/retort-placement/harvest2.py:56-61 | docs/research/retort-placement/harvest3.py:60-65 | docs/research/retort-placement/harvest4.py:62-67 — 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) packages/horizon/crate/src/lib.rs:113 — packages/horizon/crate/src/lib.rs:113-128 | packages/oo-agents/crate/src/lib.rs:91-106 — before extracting anything, compare `packages/horizon/crate/src/lib.rs` and `packages/oo-agents/crate/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `packages/horizon/crate/src/lib.rs:113` 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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×1
  • Duplicated block (10 lines × 2) kimi-k3-harness/crates/k3rs/src/ops.rs:280 — kimi-k3-harness/crates/k3rs/src/ops.rs:280-289 | kimi-k3-harness/crates/k3rs/src/ops.rs:299-308 — 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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) kimi-k3-harness/crates/k3rs/src/avx2.rs:71 — kimi-k3-harness/crates/k3rs/src/avx2.rs:71-78 | kimi-k3-harness/crates/k3rs/src/avx2.rs:97-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `kimi-k3-harness/crates/k3rs/src/avx2.rs:71` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `row` to `&[f32]` in one and `&[u16]` 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.
D4 · Code Duplication · Duplicated block (11–13 lines × 2) · ×1
  • Duplicated block (11–13 lines × 2) kimi-k3-harness/crates/k3rs/src/json.rs:144 — kimi-k3-harness/crates/k3rs/src/json.rs:144-156 | packages/oo-agents/crate/src/lib.rs:153-163 — 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 `kimi-k3-harness/crates/k3rs/src/json.rs:144` 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) kimi-k3-harness/crates/k3rs/src/json.rs:70 — kimi-k3-harness/crates/k3rs/src/json.rs:70-74 | packages/oo-agents/crate/src/lib.rs:123-127 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) packages/horizon/crate/src/lib.rs:917 — packages/horizon/crate/src/lib.rs:917-922 | packages/oo-agents/crate/src/lib.rs:1390-1395 — before extracting anything, compare `packages/horizon/crate/src/lib.rs` and `packages/oo-agents/crate/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Edited copies of one member (4 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 2+ corresponding lines) scripts/generate-readme-visuals.py:21 — scripts/generate-readme-visuals.py:21-22 | scripts/generate-readme-visuals.py:26-27 | scripts/generate-readme-visuals.py:31-32 | scripts/generate-readme-visuals.py:36-37 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: Rust 1.88 rust-toolchain.toml:1 — rust-toolchain.toml declares Rust 1.88 as this project's toolchain file, and Rust 1.88, superseded by 1.89 on 2025-08-07 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-08-07 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
D5 · Coupling · Unstable project metaharness · ×1
  • Unstable project metaharness — metaharness has instability 0.88 with 1 dependents.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: RuvSecurityMemory (LCOM4 4) packages/darwin-mode/src/security/memory.ts:111 — RuvSecurityMemory's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
IC1 · Incompleteness & stubs · Both branches are identical · ×1
  • Both branches are identical — the condition decides nothing REDACTED:360 — Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×1
  • Outbound HTTP without resilience services/apicompletions/src/providers/openrouter.ts:30 — `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
R10 · Code Duplication · Duplication concentrated across 30 sibling directories (95 clone groups) · ×1
  • Duplication concentrated across 30 sibling directories (95 clone groups) packages/evals-hle/src/evaluator.ts:7 — 95 duplicated blocks under packages/ have copies in at least two of the sibling directories agntcy, arc-agi-3, arc-agi-3-chatgpt, avo, create-agent-harness, darwin-mode (+24 more sibling(s) not listed) — 78 of them are reported below, and 17 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 95 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 95 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 95 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 36 sibling directories (19 clone groups) · ×1
  • Duplication concentrated across 36 sibling directories (19 clone groups) examples-packages/example-ads/bin/scaffold.mjs:16 — 19 of the duplicated blocks reported below have copies in at least two of the sibling directories claude-code, codex, coding, copilot, devops, education (+30 more sibling(s) not listed) under examples-packages/. That concentration is one structural fact, not 19 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 19 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 6 sibling directories (15 clone groups) · ×1
  • Duplication concentrated across 6 sibling directories (15 clone groups) apps/web-ui/src/generator/scaffold.ts:195 — 15 duplicated blocks under the repository root have copies in at least two of the sibling directories apps, experiments, kimi-k3-harness, packages, scripts, services — 11 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 15 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 15 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 15 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (7 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (7 clone groups) experiments/credit-feedback/lib.mjs:28 — 7 duplicated blocks under experiments/ have copies in at least two of the sibling directories credit-feedback, router-calibration-loop, signal-flywheel, turn-credit-acceptance — 6 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block with local edits (176 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (176 matched lines × 2 locations) REDACTED:41 — REDACTED:41 · REDACTED:53 — the two spans are one implementation copied and then locally edited — 1210 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (114 identical lines × 2 files) · ×1
  • Wholesale file copy (114 identical lines × 2 files) packages/evals-hle/src/evaluator.ts:7 — packages/evals-hle/src/evaluator.ts:7 · packages/evals-math/src/evaluator.ts:7 — these 2 files are line-for-line copies of one another — 114 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (103 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (103 matched lines × 2 locations) apps/web-ui/src/generator/scaffold.ts:195 — apps/web-ui/src/generator/scaffold.ts:195 · packages/create-agent-harness/src/host-config.ts:62 — the two spans are one implementation copied and then locally edited — 856 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (78 identical lines × 2 files) · ×1
  • Wholesale file copy (78 identical lines × 2 files) packages/evals-hle/src/genome.ts:14 — packages/evals-hle/src/genome.ts:14 · packages/evals-math/src/genome.ts:16 — these 2 files are line-for-line copies of one another — 78 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (77 lines × 3 locations) · ×1
  • Duplicated block (77 lines × 3 locations) packages/evals-hle/src/evaluator.ts:79 — packages/evals-hle/src/evaluator.ts:79 · packages/evals-math/src/evaluator.ts:79 · packages/evals-sql/src/evaluator.ts:82 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block with local edits (69 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (69 matched lines × 2 locations) experiments/credit-feedback/lib.mjs:28 — experiments/credit-feedback/lib.mjs:28 · experiments/turn-credit-acceptance/lib.mjs:27 — the two spans are one implementation copied and then locally edited — 527 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (67 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (67 matched lines × 2 locations) packages/darwin-mode/src/archive.ts:40 — packages/darwin-mode/src/archive.ts:40 · packages/darwin-mode/src/numeric-archive.ts:17 — the two spans are one implementation copied and then locally edited — 546 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (60 lines × 18 locations) · ×1
  • Duplicated block (60 lines × 18 locations) examples-packages/example-ads/bin/scaffold.mjs:16 — examples-packages/example-ads/bin/scaffold.mjs:16 · examples-packages/example-aws/bin/scaffold.mjs:16 · examples-packages/example-azure/bin/scaffold.mjs:16 · examples-packages/example-bio/bin/scaffold.mjs:16 · +14 more site(s) not listed — the 18 copies are spread across 18 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 18 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (60 lines × 4 locations) · ×1
  • Duplicated block (60 lines × 4 locations) packages/evals-extract/src/data.ts:36 — packages/evals-extract/src/data.ts:36 · packages/evals-hle/src/data.ts:32 · packages/evals-math/src/data.ts:31 · packages/evals-sql/src/data.ts:34 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (53 lines × 2 locations) · ×1
  • Duplicated block (53 lines × 2 locations) packages/evals-hle/src/leakage.ts:20 — packages/evals-hle/src/leakage.ts:20 · packages/evals-math/src/leakage.ts:20 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (52 lines × 5 locations) · ×1
  • Duplicated block (52 lines × 5 locations) packages/evals-extract/src/data.ts:36 — packages/evals-extract/src/data.ts:36 · packages/evals-hle/src/data.ts:32 · packages/evals-math/src/data.ts:31 · packages/evals-servedmodel/src/data.ts:25 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (52 lines × 2 locations) · ×1
  • Duplicated block (52 lines × 2 locations) packages/evals-hle/src/data.ts:49 — packages/evals-hle/src/data.ts:49 · packages/evals-toolcall/src/data.ts:57 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Wholesale file copy (52 identical lines × 2 files) · ×1
  • Wholesale file copy (52 identical lines × 2 files) packages/evals-hle/src/score.ts:11 — packages/evals-hle/src/score.ts:11 · packages/evals-math/src/score.ts:11 — these 2 files are line-for-line copies of one another — 52 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (51 lines × 5 locations) · ×1
  • Duplicated block (51 lines × 5 locations) packages/evals-extract/src/leakage.ts:24 — packages/evals-extract/src/leakage.ts:24 · packages/evals-hle/src/leakage.ts:24 · packages/evals-math/src/leakage.ts:24 · packages/evals-sql/src/leakage.ts:24 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (50 lines × 2 locations) · ×1
  • Duplicated block (50 lines × 2 locations) packages/darwin-mode/src/openrouter-mutator.ts:66 — packages/darwin-mode/src/openrouter-mutator.ts:66 · packages/darwin-mode/src/requesty-mutator.ts:58 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (48 lines × 4 locations) · ×1
  • Duplicated block (48 lines × 4 locations) packages/evals-extract/src/evaluator.ts:125 — packages/evals-extract/src/evaluator.ts:125 · packages/evals-hle/src/evaluator.ts:112 · packages/evals-math/src/evaluator.ts:112 · packages/evals-sql/src/evaluator.ts:115 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (48 lines × 3 locations) · ×1
  • Duplicated block (48 lines × 3 locations) packages/evals-extract/src/genome.ts:15 — packages/evals-extract/src/genome.ts:15 · packages/evals-hle/src/genome.ts:13 · packages/evals-math/src/genome.ts:15 — the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (42 lines × 5 locations) · ×1
  • Duplicated block (42 lines × 5 locations) packages/evals-extract/src/score.ts:38 — packages/evals-extract/src/score.ts:38 · packages/evals-hle/src/score.ts:38 · packages/evals-math/src/score.ts:38 · packages/evals-sql/src/score.ts:38 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (40 lines × 2 locations) · ×1
  • Duplicated block (40 lines × 2 locations) packages/create-agent-harness/src/genome.ts:197 — packages/create-agent-harness/src/genome.ts:197 · packages/create-agent-harness/src/threat-model.ts:209 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (37 lines × 2 locations) · ×1
  • Duplicated block (37 lines × 2 locations) apps/web-ui/src/generator/render.ts:19 — apps/web-ui/src/generator/render.ts:19 · packages/create-agent-harness/src/renderer.ts:32 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (36 lines × 5 locations) · ×1
  • Duplicated block (36 lines × 5 locations) packages/evals-extract/src/calibration.ts:10 — packages/evals-extract/src/calibration.ts:10 · packages/evals-hle/src/calibration.ts:10 · packages/evals-math/src/calibration.ts:10 · packages/evals-sql/src/calibration.ts:10 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (32 lines × 5 locations) · ×1
  • Duplicated block (32 lines × 5 locations) packages/evals-extract/src/gate.ts:26 — packages/evals-extract/src/gate.ts:26 · packages/evals-hle/src/gate.ts:29 · packages/evals-math/src/gate.ts:29 · packages/evals-sql/src/gate.ts:30 · +1 more site(s) not listed — the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (31 lines × 2 locations) · ×1
  • Duplicated block (31 lines × 2 locations) packages/evals-math/src/verifier.ts:31 — packages/evals-math/src/verifier.ts:31 · packages/evals-toolcall/src/verifier.ts:41 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block with local edits (31 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (31 matched lines × 2 locations) packages/horizon/src/core.ts:15 — packages/horizon/src/core.ts:15 · packages/oo-agents/src/vm.ts:34 — the two spans are one implementation copied and then locally edited — 248 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (29 lines × 6 locations) · ×1
  • Duplicated block (29 lines × 6 locations) packages/evals-extract/src/evaluator.ts:125 — packages/evals-extract/src/evaluator.ts:125 · packages/evals-hle/src/evaluator.ts:112 · packages/evals-math/src/evaluator.ts:112 · packages/evals-servedmodel/src/evaluator.ts:48 · +2 more site(s) not listed — the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (25 lines × 5 locations) · ×1
  • Duplicated block (25 lines × 5 locations) packages/evals-extract/src/routing.ts:11 — packages/evals-extract/src/routing.ts:11 · packages/evals-hle/src/routing.ts:10 · packages/evals-math/src/routing.ts:10 · packages/evals-sql/src/routing.ts:11 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (24 lines × 5 locations) · ×1
  • Duplicated block (24 lines × 5 locations) packages/evals-extract/src/genome.ts:90 — packages/evals-extract/src/genome.ts:90 · packages/evals-hle/src/genome.ts:88 · packages/evals-math/src/genome.ts:93 · packages/evals-sql/src/genome.ts:97 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (23 matched lines × 2 locations) examples-packages/devops/bin/scaffold.mjs:2 — examples-packages/devops/bin/scaffold.mjs:2 · examples-packages/sales/bin/scaffold.mjs:2 — the two spans are one implementation copied and then locally edited — 118 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (22 lines × 3 locations) · ×1
  • Duplicated block (22 lines × 3 locations) examples-packages/coding/bin/scaffold.mjs:5 — examples-packages/coding/bin/scaffold.mjs:5 · examples-packages/github-actions/bin/scaffold.mjs:5 · examples-packages/opencode/bin/scaffold.mjs:5 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R2 · Cyclomatic Complexity · Complex function verifyProductionBindings (cyclomatic 96, cognitive 95) · ×1
  • Complex function verifyProductionBindings (cyclomatic 96, cognitive 95) packages/flywheel/src/production-replay.ts:13 — verifyProductionBindings has cyclomatic complexity 96 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function runProductionFlywheel (cyclomatic 93, cognitive 142) · ×1
  • Complex function runProductionFlywheel (cyclomatic 93, cognitive 142) packages/flywheel/src/production-run.ts:12 — runProductionFlywheel has cyclomatic complexity 93 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateSupervisorState (cyclomatic 93, cognitive 125) · ×1
  • Complex function validateSupervisorState (cyclomatic 93, cognitive 125) packages/arc-agi-3/src/checkpoint.ts:476 — validateSupervisorState has cyclomatic complexity 93 and cognitive complexity 125; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function load (cyclomatic 88, cognitive 78) · ×1
  • Complex function load (cyclomatic 88, cognitive 78) packages/arc-agi-3/src/plan-archive.ts:793 — load has cyclomatic complexity 88 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function runSim (cyclomatic 82, cognitive 203) · ×1
  • Complex function runSim (cyclomatic 82, cognitive 203) packages/radio/src/sim.ts:451 — runSim has cyclomatic complexity 82 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 81, cognitive 77) · ×1
  • Complex function (anonymous) (cyclomatic 81, cognitive 77) packages/arc-agi-3-chatgpt/src/official-factory.ts:1033 — (anonymous) has cyclomatic complexity 81 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 71, cognitive 74) · ×1
  • Complex function (anonymous) (cyclomatic 71, cognitive 74) packages/darwin-mode/src/safety-ast.ts:175 — (anonymous) has cyclomatic complexity 71 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateTransitionReceiptSchema (cyclomatic 70, cognitive 45) · ×1
  • Complex function validateTransitionReceiptSchema (cyclomatic 70, cognitive 45) packages/arc-agi-3/src/receipts.ts:244 — validateTransitionReceiptSchema has cyclomatic complexity 70 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function enableMetaProxyService (cyclomatic 68, cognitive 152) · ×1
  • Complex function enableMetaProxyService (cyclomatic 68, cognitive 152) packages/create-agent-harness/src/meta-proxy-service.ts:392 — enableMetaProxyService has cyclomatic complexity 68 and cognitive complexity 152; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateCheckpointCrossFields (cyclomatic 65, cognitive 44) · ×1
  • Complex function validateCheckpointCrossFields (cyclomatic 65, cognitive 44) packages/arc-agi-3/src/checkpoint.ts:741 — validateCheckpointCrossFields has cyclomatic complexity 65 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function main (cyclomatic 63, cognitive 101) · ×1
  • Complex function main (cyclomatic 63, cognitive 101) scripts/nightly-sota-review.mjs:340 — main has cyclomatic complexity 63 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function commit (cyclomatic 61, cognitive 57) · ×1
  • Complex function commit (cyclomatic 61, cognitive 57) packages/arc-agi-3/src/memory.ts:254 — commit has cyclomatic complexity 61 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateBeliefGraphSnapshot (cyclomatic 61, cognitive 48) · ×1
  • Complex function validateBeliefGraphSnapshot (cyclomatic 61, cognitive 48) packages/arc-agi-3/src/belief-graph.ts:77 — validateBeliefGraphSnapshot has cyclomatic complexity 61 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function run (cyclomatic 59, cognitive 99) · ×1
  • Complex function run (cyclomatic 59, cognitive 99) REDACTED:421 — run has cyclomatic complexity 59 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function commitTypedSupervisorDirective (cyclomatic 59, cognitive 46) · ×1
  • Complex function commitTypedSupervisorDirective (cyclomatic 59, cognitive 46) packages/arc-agi-3/src/supervisor.ts:220 — commitTypedSupervisorDirective has cyclomatic complexity 59 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function evolve (cyclomatic 57, cognitive 122) · ×1
  • Complex function evolve (cyclomatic 57, cognitive 122) packages/darwin-mode/src/evolve.ts:311 — evolve has cyclomatic complexity 57 and cognitive complexity 122; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function verifyMultiGenerationEvidence (cyclomatic 57, cognitive 88) · ×1
  • Complex function verifyMultiGenerationEvidence (cyclomatic 57, cognitive 88) packages/flywheel/src/multigeneration-proof.ts:276 — verifyMultiGenerationEvidence has cyclomatic complexity 57 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function metaProxyCmd (cyclomatic 56, cognitive 85) · ×1
  • Complex function metaProxyCmd (cyclomatic 56, cognitive 85) REDACTED:741 — metaProxyCmd has cyclomatic complexity 56 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function preregistrationValid (cyclomatic 53, cognitive 27) · ×1
  • Complex function preregistrationValid (cyclomatic 53, cognitive 27) packages/avo/src/claim-gate.ts:462 — preregistrationValid has cyclomatic complexity 53 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function evolveNumeric (cyclomatic 52, cognitive 104) · ×1
  • Complex function evolveNumeric (cyclomatic 52, cognitive 104) packages/darwin-mode/src/numeric-evolve.ts:57 — evolveNumeric has cyclomatic complexity 52 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateCheckpointSchema (cyclomatic 52, cognitive 38) · ×1
  • Complex function validateCheckpointSchema (cyclomatic 52, cognitive 38) packages/arc-agi-3/src/checkpoint.ts:341 — validateCheckpointSchema has cyclomatic complexity 52 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateExpectation (cyclomatic 51, cognitive 46) · ×1
  • Complex function validateExpectation (cyclomatic 51, cognitive 46) packages/arc-agi-3/src/canonical.ts:719 — validateExpectation has cyclomatic complexity 51 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function disableMetaProxyService (cyclomatic 50, cognitive 87) · ×1
  • Complex function disableMetaProxyService (cyclomatic 50, cognitive 87) packages/create-agent-harness/src/meta-proxy-service.ts:682 — disableMetaProxyService has cyclomatic complexity 50 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function verifyReplayBundle (cyclomatic 47, cognitive 82) · ×1
  • Complex function verifyReplayBundle (cyclomatic 47, cognitive 82) packages/flywheel/src/replay.ts:96 — verifyReplayBundle has cyclomatic complexity 47 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function verifyCompletionCertificate (cyclomatic 45, cognitive 85) · ×1
  • Complex function verifyCompletionCertificate (cyclomatic 45, cognitive 85) packages/horizon/src/completion.ts:76 — verifyCompletionCertificate has cyclomatic complexity 45 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateProductionManifest (cyclomatic 45, cognitive 24) · ×1
  • Complex function validateProductionManifest (cyclomatic 45, cognitive 24) packages/flywheel/src/production-gate.ts:186 — validateProductionManifest has cyclomatic complexity 45 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function renderScaffold (cyclomatic 44, cognitive 81) · ×1
  • Complex function renderScaffold (cyclomatic 44, cognitive 81) packages/create-agent-harness/src/index.ts:681 — renderScaffold has cyclomatic complexity 44 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function addCandidates (cyclomatic 44, cognitive 73) · ×1
  • Complex function addCandidates (cyclomatic 44, cognitive 73) packages/arc-agi-3/src/plan-archive.ts:390 — addCandidates has cyclomatic complexity 44 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function vectorAudit (cyclomatic 44, cognitive 65) · ×1
  • Complex function vectorAudit (cyclomatic 44, cognitive 65) scripts/sota-attest.mjs:163 — vectorAudit has cyclomatic complexity 44 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function #verifyCheckpointBindings (cyclomatic 44, cognitive 30) · ×1
  • Complex function #verifyCheckpointBindings (cyclomatic 44, cognitive 30) packages/arc-agi-3/src/avo-loop.ts:657 — #verifyCheckpointBindings has cyclomatic complexity 44 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function runFlywheelGenerations (cyclomatic 41, cognitive 69) · ×1
  • Complex function runFlywheelGenerations (cyclomatic 41, cognitive 69) packages/flywheel/src/run.ts:91 — runFlywheelGenerations has cyclomatic complexity 41 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateCheckpointBeliefHistory (cyclomatic 41, cognitive 23) · ×1
  • Complex function validateCheckpointBeliefHistory (cyclomatic 41, cognitive 23) packages/arc-agi-3/src/checkpoint.ts:881 — validateCheckpointBeliefHistory has cyclomatic complexity 41 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function validateStoredRule (cyclomatic 40, cognitive 24) · ×1
  • Complex function validateStoredRule (cyclomatic 40, cognitive 24) packages/arc-agi-3/src/memory.ts:150 — validateStoredRule has cyclomatic complexity 40 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function verifyEvidenceBundle (cyclomatic 39, cognitive 51) · ×1
  • Complex function verifyEvidenceBundle (cyclomatic 39, cognitive 51) packages/avo/src/claim-gate.ts:573 — verifyEvidenceBundle has cyclomatic complexity 39 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function auditCmd (cyclomatic 38, cognitive 49) · ×1
  • Complex function auditCmd (cyclomatic 38, cognitive 49) packages/create-agent-harness/src/audit-cmd.ts:20 — auditCmd has cyclomatic complexity 38 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 38, cognitive 22) · ×1
  • Complex function (anonymous) (cyclomatic 38, cognitive 22) packages/redblue/src/mock-target.ts:48 — (anonymous) has cyclomatic complexity 38 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function gatedSubmit (cyclomatic 37, cognitive 50) · ×1
  • Complex function gatedSubmit (cyclomatic 37, cognitive 50) packages/redblue/src/integrations/h1-submit.ts:160 — gatedSubmit has cyclomatic complexity 37 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function retrieveContrastiveExperiences (cyclomatic 37, cognitive 45) · ×1
  • Complex function retrieveContrastiveExperiences (cyclomatic 37, cognitive 45) packages/darwin-mode/src/contrastive/memory.ts:75 — retrieveContrastiveExperiences has cyclomatic complexity 37 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseRecord (cyclomatic 37, cognitive 40) · ×1
  • Complex function parseRecord (cyclomatic 37, cognitive 40) packages/field-memory/src/field-memory.ts:450 — parseRecord has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function createProductionManifest (cyclomatic 37, cognitive 31) · ×1
  • Complex function createProductionManifest (cyclomatic 37, cognitive 31) packages/flywheel/src/production-gate.ts:90 — createProductionManifest has cyclomatic complexity 37 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · packages/arc-agi-3/src/controller.ts · ×1
  • packages/arc-agi-3/src/controller.ts: 1437 lines of code packages/arc-agi-3/src/controller.ts:1 — packages/arc-agi-3/src/controller.ts has 1437 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3-chatgpt/src/store.ts · ×1
  • packages/arc-agi-3-chatgpt/src/store.ts: 1270 lines of code packages/arc-agi-3-chatgpt/src/store.ts:1 — packages/arc-agi-3-chatgpt/src/store.ts has 1270 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/field-memory/src/field-memory.ts · ×1
  • packages/field-memory/src/field-memory.ts: 1209 lines of code packages/field-memory/src/field-memory.ts:1 — packages/field-memory/src/field-memory.ts has 1209 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/create-agent-harness/src/index.ts · ×1
  • packages/create-agent-harness/src/index.ts: 1189 lines of code packages/create-agent-harness/src/index.ts:1 — packages/create-agent-harness/src/index.ts has 1189 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3-chatgpt/src/official-factory.ts · ×1
  • packages/arc-agi-3-chatgpt/src/official-factory.ts: 1188 lines of code packages/arc-agi-3-chatgpt/src/official-factory.ts:1 — packages/arc-agi-3-chatgpt/src/official-factory.ts has 1188 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/checkpoint.ts · ×1
  • packages/arc-agi-3/src/checkpoint.ts: 1093 lines of code packages/arc-agi-3/src/checkpoint.ts:1 — packages/arc-agi-3/src/checkpoint.ts has 1093 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/plan-archive.ts · ×1
  • packages/arc-agi-3/src/plan-archive.ts: 1026 lines of code packages/arc-agi-3/src/plan-archive.ts:1 — packages/arc-agi-3/src/plan-archive.ts has 1026 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/python-bridge.ts · ×1
  • packages/arc-agi-3/src/python-bridge.ts: 906 lines of code packages/arc-agi-3/src/python-bridge.ts:1 — packages/arc-agi-3/src/python-bridge.ts has 906 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/radio/src/sim.ts · ×1
  • packages/radio/src/sim.ts: 872 lines of code packages/radio/src/sim.ts:1 — packages/radio/src/sim.ts has 872 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/canonical.ts · ×1
  • packages/arc-agi-3/src/canonical.ts: 843 lines of code packages/arc-agi-3/src/canonical.ts:1 — packages/arc-agi-3/src/canonical.ts has 843 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/redblue/src/integrations/hackerone.ts · ×1
  • packages/redblue/src/integrations/hackerone.ts: 838 lines of code packages/redblue/src/integrations/hackerone.ts:1 — packages/redblue/src/integrations/hackerone.ts has 838 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/avo-loop.ts · ×1
  • packages/arc-agi-3/src/avo-loop.ts: 806 lines of code packages/arc-agi-3/src/avo-loop.ts:1 — packages/arc-agi-3/src/avo-loop.ts has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 806 lines of code REDACTED:1 — REDACTED has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/create-agent-harness/src/meta-proxy-service.ts · ×1
  • packages/create-agent-harness/src/meta-proxy-service.ts: 794 lines of code packages/create-agent-harness/src/meta-proxy-service.ts:1 — packages/create-agent-harness/src/meta-proxy-service.ts has 794 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 748 lines of code REDACTED:1 — REDACTED has 748 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/avo/src/claim-gate.ts · ×1
  • packages/avo/src/claim-gate.ts: 712 lines of code packages/avo/src/claim-gate.ts:1 — packages/avo/src/claim-gate.ts has 712 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3-chatgpt/src/tools.ts · ×1
  • packages/arc-agi-3-chatgpt/src/tools.ts: 685 lines of code packages/arc-agi-3-chatgpt/src/tools.ts:1 — packages/arc-agi-3-chatgpt/src/tools.ts has 685 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/darwin-mode/src/evolve.ts · ×1
  • packages/darwin-mode/src/evolve.ts: 619 lines of code packages/darwin-mode/src/evolve.ts:1 — packages/darwin-mode/src/evolve.ts has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/receipts.ts · ×1
  • packages/arc-agi-3/src/receipts.ts: 591 lines of code packages/arc-agi-3/src/receipts.ts:1 — packages/arc-agi-3/src/receipts.ts has 591 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 580 lines of code REDACTED:1 — REDACTED has 580 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/types.ts · ×1
  • packages/arc-agi-3/src/types.ts: 552 lines of code packages/arc-agi-3/src/types.ts:1 — packages/arc-agi-3/src/types.ts has 552 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/redblue/src/cli/index.ts · ×1
  • packages/redblue/src/cli/index.ts: 526 lines of code packages/redblue/src/cli/index.ts:1 — packages/redblue/src/cli/index.ts has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/oo-agents/src/pod.ts · ×1
  • packages/oo-agents/src/pod.ts: 507 lines of code packages/oo-agents/src/pod.ts:1 — packages/oo-agents/src/pod.ts has 507 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/host-prime-agent/src/index.ts · ×1
  • packages/host-prime-agent/src/index.ts: 481 lines of code packages/host-prime-agent/src/index.ts:1 — packages/host-prime-agent/src/index.ts has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/memory.ts · ×1
  • packages/arc-agi-3/src/memory.ts: 479 lines of code packages/arc-agi-3/src/memory.ts:1 — packages/arc-agi-3/src/memory.ts has 479 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · apps/web-ui/src/generator/scaffold.ts · ×1
  • apps/web-ui/src/generator/scaffold.ts: 477 lines of code apps/web-ui/src/generator/scaffold.ts:1 — apps/web-ui/src/generator/scaffold.ts has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/create-agent-harness/src/diag.ts · ×1
  • packages/create-agent-harness/src/diag.ts: 468 lines of code packages/create-agent-harness/src/diag.ts:1 — packages/create-agent-harness/src/diag.ts has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/create-agent-harness/src/score.ts · ×1
  • packages/create-agent-harness/src/score.ts: 441 lines of code packages/create-agent-harness/src/score.ts:1 — packages/create-agent-harness/src/score.ts has 441 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/kernel-js/src/memory-rvf.ts · ×1
  • packages/kernel-js/src/memory-rvf.ts: 429 lines of code packages/kernel-js/src/memory-rvf.ts:1 — packages/kernel-js/src/memory-rvf.ts has 429 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/arc-agi-3/src/belief-graph.ts · ×1
  • packages/arc-agi-3/src/belief-graph.ts: 427 lines of code packages/arc-agi-3/src/belief-graph.ts:1 — packages/arc-agi-3/src/belief-graph.ts has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 414 lines of code REDACTED:1 — REDACTED has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · packages/agntcy/src/oasf/publish.ts · ×1
  • packages/agntcy/src/oasf/publish.ts: 404 lines of code packages/agntcy/src/oasf/publish.ts:1 — packages/agntcy/src/oasf/publish.ts has 404 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R4 · Test Coverage · This test file cannot be loaded · ×1
  • This test file cannot be loaded packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152 — packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152 imports './fixtures/rvf-0.4.6', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
R6 · Tooling · The declared test suite includes a file that cannot be loaded · ×1
  • The declared test suite includes a file that cannot be loaded packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152 — This repository declares test tooling, and the ✓ above records that declaration — but packages/kernel-js/__tests__/memory-rvf-metadata.test.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
R7 · Dead Code · Dead file (~448 LoC) · ×1
  • Dead file (~448 LoC) packages/darwin-mode/bench/ruvector/h3-code-gate.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/darwin-mode/bench/ruvector/h3-code-localize.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~354 LoC) · ×1
  • Dead file (~354 LoC) experiments/router-calibration-loop/lib.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (experiments/router-calibration-loop/assert.mjs, experiments/router-calibration-loop/run.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~353 LoC) · ×1
  • Dead file (~353 LoC) packages/darwin-mode/bench/livecodebench/solve-lcb.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~266 LoC) · ×1
  • Dead file (~266 LoC) experiments/signal-flywheel/config.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (experiments/signal-flywheel/run.mjs) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~228 LoC) · ×1
  • Dead file (~228 LoC) packages/darwin-mode/bench/ruvector/h3-code-localize.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~188 LoC) · ×1
  • Dead file (~188 LoC) packages/darwin-mode/bench/translate/chunked-synthesis.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~149 LoC) · ×1
  • Dead file (~149 LoC) services/apicompletions/src/budget/firestore.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~145 LoC) · ×1
  • Dead file (~145 LoC) experiments/signal-flywheel/run.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~135 LoC) · ×1
  • Dead file (~135 LoC) packages/darwin-mode/bench/orchestration/probe.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~120 LoC) · ×1
  • Dead file (~120 LoC) packages/darwin-mode/bench/gaia/frames-summarize.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~117 LoC) · ×1
  • Dead file (~117 LoC) packages/darwin-mode/bench/gaia/score-gaia.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~80 LoC) · ×1
  • Dead file (~80 LoC) experiments/router-calibration-loop/run.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~78 LoC) · ×1
  • Dead file (~78 LoC) packages/darwin-mode/bench/swerebench/build-manifest.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~76 LoC) · ×1
  • Dead file (~76 LoC) experiments/router-calibration-loop/assert.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~65 LoC) · ×1
  • Dead file (~65 LoC) packages/darwin-mode/bench/polyglot/polyglot-swarm-cn-mistral.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~58 LoC) · ×1
  • Dead file (~58 LoC) scripts/propagate-plugin-manifest.mjs — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~9 LoC) · ×1
  • Dead file (~9 LoC) packages/arc-agi-3-bench/src/index.ts — no import path from any entry point (449 application, 123 tooling, 461 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Benchmark script nothing runs (~215 LoC) · ×1
  • Benchmark script nothing runs (~215 LoC) packages/aws-finops/bench/real-oracle.mjs — This script imports the product ('../dist/index.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/aws-finops/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/aws-finops/bench/real-oracle.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it.
R7 · Dead Code · Benchmark script nothing runs (~213 LoC) · ×1
  • Benchmark script nothing runs (~213 LoC) packages/projects/bench/real-cve-corpus.mjs — This script imports the product ('../dist/index.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/projects/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/projects/bench/real-cve-corpus.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it.
R7 · Dead Code · Benchmark script nothing runs (~97 LoC) · ×1
  • Benchmark script nothing runs (~97 LoC) packages/kernel-js/bench/memory-rvf-bench.mjs — This script imports the product ('../dist/memory-rvf.js'), so it is an authored benchmark, not measurement input — but nothing invokes it: no package.json script, no CI workflow or build recipe, no REDACTED, no other file under packages/kernel-js/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type `node packages/kernel-js/bench/memory-rvf-bench.mjs`, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it.
R8 · Dependency Hygiene · Unused dependency 'kolorist' · ×1
  • Unused dependency 'kolorist' packages/create-agent-harness/package.json:69 — Declared in packages/create-agent-harness/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'node-fetch' · ×1
  • Unused dependency 'node-fetch' services/apicompletions/package.json:21 — Declared in services/apicompletions/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X25 · Inert configuration knob · Option is kept and never read · ×1
  • Option is kept and never read packages/darwin-mode/src/security/codeql-oracle.ts:65 — `CodeqlDetectorOracle` accepts `opts.timeoutMs` from the caller and keeps it in `this.timeoutMs` on line 65, where only it can read the value — but nothing ever reads `this.timeoutMs`. Setting `opts.timeoutMs` therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read `this.timeoutMs` where the behaviour it configures is decided — or, if the behaviour genuinely is fixed, remove `opts.timeoutMs` from the accepted options so callers stop setting a knob that does nothing.
Minor — 135 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate apps/web-ui/src/generator/repo.ts:263 — `!!get('.mcp.json') || /modelcontextprotocol|mcp server/i.test(text)` appears character-identically in 2 files — apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:46 — `!Array.isArray(b.messages) || b.messages.length === 0` appears character-identically in 2 files — REDACTED, REDACTED. 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 packages/darwin-mode/src/contrastive/confirmation.ts:88 — `!Number.isInteger(budget.timeoutMs) || budget.timeoutMs < 1 || budget.timeoutMs > 300000` appears character-identically in 2 files — packages/darwin-mode/src/contrastive/confirmation.ts, packages/darwin-mode/src/contrastive/validation.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/field-memory/src/ruvector-storage.ts:72 — `!Number.isInteger(options.dimension) || options.dimension < 1` appears character-identically in 2 files — packages/field-memory/src/ruvector-storage.ts, packages/field-memory/src/storage.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/arc-agi-3-chatgpt/src/policy.ts:45 — `!Number.isSafeInteger(value) || value < 1 || value > maximum` appears character-identically in 4 files — packages/arc-agi-3-chatgpt/src/policy.ts, REDACTED, packages/arc-agi-3-chatgpt/src/store.ts, packages/arc-agi-3/src/python-bridge.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:311 — `!candidate || typeof candidate !== 'object'` appears character-identically in 2 files — REDACTED, packages/arc-agi-3-chatgpt/src/types.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/arc-agi-3-bench/src/model-driver.ts:77 — `!descriptor?.enumerable || !('value' in descriptor)` appears character-identically in 4 files — packages/arc-agi-3-bench/src/model-driver.ts, packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/receipts.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/create-agent-harness/src/genome.ts:233 — `!existsSync(dir) || !statSync(dir).isDirectory()` appears character-identically in 4 files — packages/create-agent-harness/src/genome.ts, packages/create-agent-harness/src/oia-manifest.ts, packages/create-agent-harness/src/score.ts, packages/create-agent-harness/src/threat-model.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/arc-agi-3/src/checkpoint.ts:527 — `!key.trim() || key.length > 128 || !Number.isFinite(value)` appears character-identically in 2 files — packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/controller.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/arc-agi-3/src/canonical.ts:242 — `!value || typeof value !== 'object' || Array.isArray(value)` appears character-identically in 2 files — packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/arc-agi-3/src/avo-loop.ts:75 — `!value || typeof value !== 'object' || Array.isArray(value) || Object.getPrototypeOf(value) !== Object.prototype` appears character-identically in 6 files — packages/arc-agi-3/src/avo-loop.ts, packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/plan-archive.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/create-agent-harness/src/diag.ts:78 — `(process.env.METAHARNESS_KERNEL_BACKEND || '').trim().toLowerCase() || null` appears character-identically in 2 files — packages/create-agent-harness/src/diag.ts, packages/kernel-js/src/index.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/evals-toolcall/src/normalizer.ts:130 — `(v.startsWith('"') && v.endsWith('"')) || (v.startsWith("'") && v.endsWith("'"))` appears character-identically in 2 files — packages/evals-toolcall/src/normalizer.ts, packages/redblue/src/config/loader.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate services/apicompletions/src/budget/firestore.ts:48 — `acct.status !== 'active' || acct.headroomExhausted` appears character-identically in 2 files — services/apicompletions/src/budget/firestore.ts, services/apicompletions/src/budget/tracker.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/evals-hle/src/score.ts:63 — `anyLeak || (formatInvalid + abstained) === results.length` appears character-identically in 2 files — packages/evals-hle/src/score.ts, packages/evals-math/src/score.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/field-memory/src/field-memory.ts:1060 — `b.similarity - a.similarity || compareText(a.record.id, b.record.id)` appears character-identically in 3 files — packages/field-memory/src/field-memory.ts, packages/field-memory/src/ruvector-storage.ts, packages/field-memory/src/storage.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/horizon/src/core.ts:28 — `buf !== this.memBuf || this.memView === null` appears character-identically in 2 files — packages/horizon/src/core.ts, packages/oo-agents/src/vm.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/evals-hle/src/leakage.ts:49 — `check.exactQuestionSeen || check.policyMentionsBenchmarkArtifact || check.promptContainsDatasetSpecificHack || check.ngramOverlapWithPublicE…` appears character-identically in 3 files — packages/evals-hle/src/leakage.ts, packages/evals-math/src/leakage.ts, packages/evals-sql/src/leakage.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/darwin-mode/src/evolve.ts:348 — `config.crossover === true && parents.length >= 2` appears character-identically in 2 files — packages/darwin-mode/src/evolve.ts, packages/darwin-mode/src/numeric-evolve.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/darwin-mode/src/archive.ts:221 — `currentId !== null && !seen.has(currentId)` appears character-identically in 2 files — packages/darwin-mode/src/archive.ts, packages/darwin-mode/src/numeric-archive.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate kimi-k3-harness/scripts/flywheel-evolve.mjs:92 — `e.anchor && !(e.anchor.candidate >= e.anchor.baseline * 0.98)` appears character-identically in 2 files — kimi-k3-harness/scripts/flywheel-evolve.mjs, packages/radio/scripts/flywheel-radio.mjs. 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 packages/evals-hle/src/evaluator.ts:87 — `escalate && tier !== 'frontier' && cost < genome.global.maxCostPerQuestionUsd` appears character-identically in 2 files — packages/evals-hle/src/evaluator.ts, packages/evals-math/src/evaluator.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate apps/web-ui/src/generator/repo.ts:237 — `get('pyproject.toml') || get('requirements.txt')` appears character-identically in 2 files — apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/host-claude-code/src/index.ts:150 — `isSafeIdentifier && !YAML_RESERVED_BARE.test(s)` appears character-identically in 3 files — packages/host-claude-code/src/index.ts, packages/host-hermes/src/index.ts, packages/host-openclaw/src/index.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate packages/evals-hle/src/verifier.ts:33 — `mode === 'none' || input.answer === null` appears character-identically in 2 files — packages/evals-hle/src/verifier.ts, packages/evals-math/src/verifier.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • + 15 more in this group — see findings.md.
X7 · Silent fallback defaults · Silent fallback default in catch · ×40
  • Silent fallback default in catch examples-packages/example-ads/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-aws/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-azure/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-bio/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-datadog/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-fhir/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-gcp/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-github/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-huggingface/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-iot/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-nasa/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-pinecone/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-qiskit/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-slack/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-stripe/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-supabase/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-twilio/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch examples-packages/example-web3/bin/scaffold.mjs:37 — `writeBundle` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/avo/src/memory.ts:102 — `retrieve` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/aws-finops/bench/real-oracle.mjs:213 — `safeVer` swallows every exception into `return 'unknown'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch REDACTED:205 — `metaProxyLogLines` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/create-agent-harness/src/index.ts:149 — `loadCatalog` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/create-agent-harness/src/mcp-cmd.ts:54 — `readClaims` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/create-agent-harness/src/score.ts:96 — `countDir` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch packages/darwin-mode/bench/cve-bench/gcp-cascade-dispatch.mjs:45 — `listVMs` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • + 15 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×15
  • redundant comment packages/create-agent-harness/src/genome.ts:135 — "3. MCP risk model" repeats the code it sits on: 3 of its 3 words (mcp, risk, model) are already in `out.push('3. MCP risk model');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/create-agent-harness/src/genome.ts:156 — "6. Recommended harness plan" repeats the code it sits on: 3 of its 3 words (recommended, harness, plan) are already in `out.push('6. Recommended harness plan');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/create-agent-harness/src/score.ts:336 — "Detect tests: any of __tests__/ tests/ test/." repeats the code it sits on: 3 of its 3 words (detect, tests, test) are already in `const testsDetected = testCoverage.score > 0;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/__tests__/gepa-promotion.test.ts:12 — "Fixture: a details map from an array of [gold, failureClass, thrash, cost] tuples." repeats the code it sits on: 8 of its 10 words (details, map, array, gold, failure, class, thrash, cost) are already in `const mkDetails = (rows: Array<[boolean, number, number?, number?]>) => Object.fromEntries(rows.map(([gold, fc, thrash, …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/ablation/poincare-vs-euclidean.mjs:60 — "strategy -> Set(niche)" repeats the code it sits on: 3 of its 3 words (strategy, set, niche) are already in `const strategyNiche = new Map();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/ruvector/finalize-h3-results.mjs:107 — "Replace delta table" repeats the code it sits on: 3 of its 3 words (replace, delta, table) are already in `updated = replaceTableBody(updated, 'Δ_dense (pp) [95% CI]', deltaRows);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/ruvector/finalize-h3-results.mjs:109 — "Replace gap table" repeats the code it sits on: 3 of its 3 words (replace, gap, table) are already in `updated = replaceTableBody(updated, 'Gap@base (pp)', gapRows);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/ruvector/finalize-h3-results.mjs:111 — "Replace cost table" repeats the code it sits on: 3 of its 3 words (replace, cost, table) are already in `updated = replaceTableBody(updated, '$ total (50 tasks', [...costRows, costTableTotal]);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/ruvector/memory-layer.mjs:512 — "Create graph node with label 'Document'" repeats the code it sits on: 4 of its 5 words (create, node, label, document) are already in `await this.db.createNode({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/bench/swebench/output-modes.test.mjs:171 — "next=stop forces continue_fable false" repeats the code it sits on: 5 of its 6 words (next, stop, continue, fable, false) are already in `assert.equal(parseContinuation('{"continue_fable":true,"next":"stop"}').continue_fable, false);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/darwin-mode/src/security/swarm.ts:128 — "Reproduced under repro-test/fuzz when the pipeline includes them." repeats the code it sits on: 6 of its 6 words (reproduced, repro, test, fuzz, pipeline, includes) are already in `if (genome.validationPipeline.includes('repro-test') || genome.fuzzBudgetSeconds >= 30) reproduced += 1;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment packages/projects/src/trace.ts:155 — "(a) Repeated identical retrieval/memory/tool spans." repeats the code it sits on: 5 of its 6 words (repeated, retrieval, memory, tool, spans) are already in `const repeatKinds = new Set<SpanKind>(['retrieval', 'memory', 'tool']);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment scripts/audit-deps.mjs:140 — "Probe cargo-audit" repeats the code it sits on: 3 of its 3 words (probe, cargo, audit) are already in `const probe = await execFile(process.platform === 'win32' ? 'cmd.exe' : 'cargo',`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment scripts/propagate-plugin-manifest.mjs:38 — "Insert after .claude/settings.json.tmpl" repeats the code it sits on: 4 of its 5 words (claude, settings, json, tmpl) are already in `const idx = m.files.findIndex((f) => f.src === '.claude/settings.json.tmpl');`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment scripts/release.mjs:160 — "5. git commit + tag" repeats the code it sits on: 3 of its 3 words (git, commit, tag) are already in `log('STEP', `5/5 git commit + tag v${newVersion}`);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D25 · ADR Conformance · ADR not followed · ×3
  • ADR not followed: ADR-248: @metaharness/turn-credit — offline recursive turn-level credit assignment (AgentOPSD) docs/adrs/ADR-248-turn-credit.md:46 — docs/adrs/ADR-248-turn-credit.md:46 rules out `toQualityLabels` in Adapters, but production code uses it: packages/turn-credit/src/adapters.ts:77. Remove the use, or supersede the record if the decision changed.
  • ADR not followed: ADR-248: @metaharness/turn-credit — offline recursive turn-level credit assignment (AgentOPSD) docs/adrs/ADR-248-turn-credit.md:46 — docs/adrs/ADR-248-turn-credit.md:46 rules out `toMemoryFeedback` in Adapters, but production code uses it: packages/turn-credit/src/adapters.ts:90. Remove the use, or supersede the record if the decision changed.
  • ADR not followed: ADR-279: Wiring `withSequentialEvidence` into the flywheel's live promotion path (and its replay) docs/adrs/ADR-279-flywheel-sequential-evidence-wiring.md:69 — docs/adrs/ADR-279-flywheel-sequential-evidence-wiring.md:69 rules out `meetsPromotionRule`, but production code uses it: packages/flywheel/src/gate.ts:52, packages/flywheel/src/gate.ts:98, packages/flywheel/src/index.ts:10, packages/flywheel/src/production-gate.ts:4, packages/flywheel/src/production-gate.ts:126 (+41 more). Remove the use, or supersede the record if the decision changed.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×3
  • Projects may be oversized for their cohesion packages/darwin-mode/package.json:1 — `packages/darwin-mode` (37987 LoC, 481 module-visible types across 34 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion packages/create-agent-harness/package.json:1 — `packages/create-agent-harness` (11546 LoC, 127 module-visible types across 3 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion package.json:1 — `(repository root)` (11081 LoC, 70 module-visible types across 17 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D20 · ADR Quality · ADR superseded but its status says otherwise · ×2
  • ADR superseded but its status says otherwise docs/adrs/ADR-108-darwin-evolution-series-synthesis.md:3 — docs/adrs/ADR-108-darwin-evolution-series-synthesis.md:3 says "Accepted (synthesis / index)", but docs/adrs/ADR-035-product-naming.md supersedes it. Two records now claim the same ground; mark this one "Superseded by" its successor.
  • ADR superseded but its status says otherwise docs/adrs/ADR-118-darwin-swe-suite-generalizes.md:3 — docs/adrs/ADR-118-darwin-swe-suite-generalizes.md:3 says "Accepted (measured) — generalization of ADR-117", but docs/adrs/ADR-035-product-naming.md supersedes it. Two records now claim the same ground; mark this one "Superseded by" its successor.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
M4 · Documentation accuracy · README/code drift · ×2
  • README/code drift packages/agntcy/README.md:44 — packages/agntcy/README.md names Node.js 22, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, pinned 20. 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/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md:399 — docs/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md names ReAct 41, but the manifest declares `react` ^18.3.1. 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.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×2
  • Hand-rolled JSON/XML parsing via regex packages/darwin-mode/src/gepa/metric.ts:37 — 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 JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex packages/darwin-mode/src/gepa/metric.ts:38 — 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 JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
D20 · ADR Quality · ADR declares no status · ×1
  • ADR declares no status docs/adrs/ADR-271-avo-receipts-as-flywheel-gate-evidence.md:1 — `docs/adrs/ADR-271-avo-receipts-as-flywheel-gate-evidence.md` declares no status, while 249 of the 249 other records in `docs/adrs` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
D21 · Naming Consistency · `callLLM` spells `LLM` where 14 names in the project spell it `Llm` · ×1
  • `callLLM` spells `LLM` where 14 names in the project spell it `Llm` packages/darwin-mode/bench/ruvector/h3-code-localize.mjs:79 — 14 of 15 names in project agent-harness-generator spell the token `Llm` (14 of 15; unit: names in project agent-harness-generator containing `Llm`). Peers: run-cognition.mkLlm (packages/darwin-mode/bench/cognition/run-cognition.mjs:72); solve-gaia.mkLlm (packages/darwin-mode/bench/gaia/solve-gaia.mjs:77); probe.mkLlm (packages/darwin-mode/bench/orchestration/probe.mjs:55); probe.mockLlm (packages/darwin-mode/bench/orchestration/probe.mjs:75); h1-pilot.mkLlm (packages/darwin-mode/bench/ruvector/h1-pilot.mjs:255). Rename to `callLlm`. [rule N6]
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D31 · IaC & Container Security · Low IaC · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
IC1 · Incompleteness & stubs · Disabled test · ×1
  • Disabled test packages/agntcy/src/oasf/__tests__/publish.test.ts:213 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
IC1 · Incompleteness & stubs · Empty method body · ×1
  • Empty method body packages/horizon/scripts/demo.mjs:37 — `flushDurableFacts` has an empty body — confirm it's an intentional no-op and not an unfinished method.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 1/51 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/poker-darwin`, `examples-packages/claude-code`, `examples-packages/codex`, `examples-packages/coding` and 45 more.
P4 · Deployment & Rollback · No rollback/health safety · ×1
  • No rollback/health safety .github/workflows/dream-release.yml:157 — Deployment is orchestrated by compose, and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no compose service declares a `healthcheck:` that uses them and nothing pins a previous image to fall back to — so a release that starts but does not serve looks healthy, and reversing it is a manual step.
R7 · Dead Code · Unused export 'WASM_PATH' · ×1
  • Unused export 'WASM_PATH' kimi-k3-harness/scripts/kernel.mjs:9 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'newRequestId' · ×1
  • Unused export 'newRequestId' packages/arc-agi-3-bench/src/canonical.ts:46 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/arc-agi-3-bench/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/arc-agi-3-bench/src/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'PlannerEpisodeState' · ×1
  • Unused export 'PlannerEpisodeState' packages/arc-agi-3-bench/src/types.ts:275 — Nothing ultimately consumes this binding: its only referrer is the re-export in packages/arc-agi-3-bench/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in packages/arc-agi-3-bench/src/index.ts in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export '_resetRuvllmCacheForTests' · ×1
  • Unused export '_resetRuvllmCacheForTests' packages/create-agent-harness/src/analyze-repo.ts:358 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'agenticowAvailable' · ×1
  • Unused export 'agenticowAvailable' packages/darwin-mode/bench/cognition/cognition-harness.mjs:31 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'EMB_DIM' · ×1
  • Unused export 'EMB_DIM' packages/darwin-mode/bench/cognition/cognition-harness.mjs:33 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export '_internal' · ×1
  • Unused export '_internal' packages/darwin-mode/bench/cve-bench/env-recipe.mjs:223 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'BASE_SYSTEM' · ×1
  • Unused export 'BASE_SYSTEM' packages/darwin-mode/bench/gaia/scaffolds.mjs:36 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'embedBatch' · ×1
  • Unused export 'embedBatch' packages/darwin-mode/bench/ruvector/embedder.mjs:61 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'default' · ×1
  • Unused export 'default' packages/darwin-mode/bench/swebench/gepa/branch-memory.mjs:409 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'NoopBudgetTracker' · ×1
  • Unused export 'NoopBudgetTracker' services/apicompletions/src/budget/tracker.ts:246 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'getFirestore' · ×1
  • Unused export 'getFirestore' services/apicompletions/src/firestore/client.ts:75 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'FirestoreLedgerStore' · ×1
  • Unused export 'FirestoreLedgerStore' services/apicompletions/src/metering/ledger.ts:82 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'PubSubUsagePublisher' · ×1
  • Unused export 'PubSubUsagePublisher' services/apicompletions/src/metering/ledger.ts:98 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'FirestoreIdempotencyStore' · ×1
  • Unused export 'FirestoreIdempotencyStore' services/apicompletions/src/ratelimit/idempotency.ts:60 — Nothing imports this binding — it is safe to review for removal.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 5/13 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types · Null assertions (`!`) override strict null checking · ×1
  • Null assertions (`!`) override strict null checking — ~2.8 `!` null assertions per 1k TypeScript source lines — 257 assertion(s) across the 91884 source line(s) of the 491 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/arc-agi-3/src/plan-archive.ts (21), packages/arc-agi-3/src/receipts.ts (10), packages/create-agent-harness/src/index.ts (10). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Minor — 17 finding(s)
D10 · Test Quality · Skipped (documented) · ×13
  • Skipped (documented): (unnamed test) packages/kernel-js/__tests__/loader.test.ts:153 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/host-prime-agent/__tests__/index.test.ts:203 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/darwin-mode/__tests__/numeric-surrogate.test.ts:54 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/darwin-mode/__tests__/security/tier2-isolation.test.ts:195 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/darwin-mode/__tests__/perf/concurrency.perf.test.ts:84 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/darwin-mode/__tests__/perf/mapLimit.test.ts:125 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/create-agent-harness/__tests__/generated-journey.test.ts:83 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/create-agent-harness/__tests__/meta-proxy-launchagent.real.test.ts:39 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/create-agent-harness/__tests__/meta-proxy-scheduled-task.real.test.ts:33 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/create-agent-harness/__tests__/upgrade-adversarial.test.ts:89 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/create-agent-harness/__tests__/upgrade-adversarial.test.ts:95 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
  • Skipped (documented): (unnamed test) packages/agntcy/src/oasf/__tests__/publish.test.ts:181 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) packages/agntcy/src/oasf/__tests__/publish.test.ts:193 — Skipped with a documented reason — a deferral, not lazy debt: switched off by it.skipIf
D24 · Comment Value · doc comments repeat the names · ×3
  • doc comments repeat the names packages/bench/src/index.ts:64 — 0 of 0 documented parameters and 2 of 137 summaries in `@metaharness/bench` only repeat the member or parameter name (e.g. "p50 latency in ms." for `p50_latency_ms`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/kernel-js/src/self-evolution.ts:24 — 0 of 0 documented parameters and 1 of 91 summaries in `@metaharness/kernel` only repeat the member or parameter name (e.g. "Latency in ms." for `latencyMs`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names packages/redblue/src/integrations/h1-submit.ts:75 — 0 of 0 documented parameters and 1 of 249 summaries in `@metaharness/redblue` only repeat the member or parameter name (e.g. "Result of a gated submit." for `GatedSubmitResult`). Delete the restating tags, or add what the name does not say.
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: ruflo-kernel — ruflo-kernel: abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-fc7aedfa7dc042aba9750017918c7459/history.json --exit-code 0 --source .38artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-fc7aedfa7dc042aba9750017918c7459/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=58" --report-format json --report-path /tmp/watchdog-gitleaks-fc7aedfa7dc042aba9750017918c7459/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-fc7aedfa7dc042aba9750017918c7459/tree.json --exit-code 0 --source .3artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude apps/web-ui/src/generated .57artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .2artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .5artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 13 file(s) — `packages/arc-agi-3-chatgpt/src/official-avo-runtime.ts`, `packages/arc-agi-3-chatgpt/src/tools.ts`, `packages/arc-agi-3-chatgpt/src/types.ts`, `packages/arc-agi-3/src/avo-loop.ts`, `packages/arc-agi-3/src/plan-archive.ts`, … (+8 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e7ae-c782-725f-b58b-0dbeb198d96f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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