Public report of gwenn-ha-dev/Siliconed, 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, 11:05 UTC · Survey ID cd_370c6cd4f0d6492982740a1bfc7520b1

gwenn-ha-dev/Siliconed

Measured 17 November 2026, 11:04 UTC, at code version 2ca21fe

First survey, so nothing to compare with yet
CAI score 64.3out of 100 At risk

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

A medium codebase: 94,184 lines of product code in 8 projects, tests not counted · Estimated rebuild effort: about 1.0 person-years · Weakest lens: Production Readiness, 55.0

Findings by how serious they are

11 critical 829 serious 35 minor

28 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, 11:04 UTC

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

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

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

44of 44 dimensions measured by tools.
856of 875 findings point to an exact file and line, so you can open each one in the code. The other 19 concern the repository as a whole, such as missing documentation.
44dimensions across 7 lenses, read from 94,184 lines of product code in 8 projects.
Chapters

Executive summary

gwenn-ha-dev/Siliconed is rated At risk because critical security findings are open, most of them in the build pipeline. It scores 64.3 out of 100, which the At risk rating leaves unchanged. We judged it as a template or a sample, against a lower bar.

Every lens scores high enough to be rated Strong, so no single lens holds the score back. The best first step for the work it takes is fixing the package under a licence on your banned list, worth about 4.6 points. Adding automated security scanning comes next, worth about 7.0 points.

Seven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Two known security holes in the packages the code depends on can be used by attackers, and one package carries licence risk. Pinning each tool to an exact version, updating the vulnerable packages and replacing or clearing the banned-licence packages would close these risks. Moving the business rules into the object that owns the data would take care of the business object that only holds data.

The product code is 94,184 lines, about €140,000 to rebuild.

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

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

Every lens already scores high enough to be rated Strong, so no single lens holds the score back.

Code composition: what the lines of code are
Product code 79%Tests 21%
Rebuild cost: about €140,000 · Estimate
Cost to rebuild€46,000 to €230,000, for 768 to 2,437 hours of work, about 1.0 person-years for 1 to 2 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.9 at a score of 64. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 94,184 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 1 Banned license finding(s) in License Compliance.
Raises the score by about 4.6 points · Low effort · License Compliance
2
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Raises the score by about 7.0 points · Medium effort · Security & performance tooling
3
Make sure a person approves each release.
The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Raises the score by about 3.7 points · Medium effort · Deployment & Rollback

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 €140,000 to build again, about 1.0 person-years of work. Its weakest lens is Production Readiness, at 55.0 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Banned license finding(s) in License Compliance. Of all the actions in this report, it raises the score most for the work it takes: about 4.6 points for low effort, because it clears the 1 License Compliance 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.2 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 10% on every change. The history of the code shows how much it changes: about 258,377 lines over the last 90 days, which is about 1,047,862 lines a year. At that pace, the extra work comes to an estimated 119.4 to 716.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 AMXLegacy AMXLegacy Measurement Measurement Siliconed Siliconed Siliconed->AMXLegacy SiliconedApp SiliconedApp SiliconedApp->Siliconed SilicontrolHelp SilicontrolHelp SiliconedApp->SilicontrolHelp SiliconedCommand SiliconedCommand Verification Verification SiliconedCommand->Verification Silicontrol Silicontrol Silicontrol->Measurement Silicontrol->SilicontrolHelp Verification->Siliconed

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.

17 modules, with 9 dependencies between them. One loop runs through 2 of the modules, marked above the diagonal.

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 SiliconedCommand2 repository3 site4 tools.oracle.common5 tools.oracle.quant_fixtures6 tools.oracle.quantized7 tools.oracle.qwen-image-28 tools.oracle.qwen-image-2.19 SiliconedApp10 tools.oracle11 tools.oracle.moss-image12 tools.oracle.qwen-image-2.1-writer13 Siliconed14 Measurement15 Silicontrol16 SilicontrolHelp17 Verification
1 SiliconedCommand
2 repository
3 site
4 tools.oracle.common
5 tools.oracle.quant_fixtures
6 tools.oracle.quantized
7 tools.oracle.qwen-image-2
8 tools.oracle.qwen-image-2.1
9 SiliconedApp305
10 tools.oracle2
11 tools.oracle.moss-image1
12 tools.oracle.qwen-image-2.1-writer1
13 Siliconed1
14 Measurement17
15 Silicontrol1
16 SilicontrolHelp3
17 Verification47
Uses a module listed above itPart of a loopThe module itself
1 SiliconedCommand2 repository3 site4 tools.oracle.common5 tools.oracle.quant_fixtures6 tools.oracle.quantized7 tools.oracle.qwen-image-28 tools.oracle.qwen-image-2.19 SiliconedApp10 tools.oracle11 tools.oracle.moss-image12 tools.oracle.qwen-image-2.1-writer13 Siliconed14 Measurement15 Silicontrol16 SilicontrolHelp17 VerificationSiliconedCommand1repository2site3tools.oracle.common4tools.oracle.quant_fixtures5tools.oracle.quantized6tools.oracle.qwen-image-27tools.oracle.qwen-image-2.18SiliconedApp9tools.oracle10tools.oracle.moss-image11tools.oracle.qwen-image-2.1-writer12Siliconed13Measurement14Silicontrol15SilicontrolHelp16Verification173052111171347

At a glance — Code Health · 70.9 · Adequate · gated by D2 ·

At a glance — Architecture · 90.3 · Adequate · gated by D26 ·

At a glance — Maturity · 66.7 · Adequate · gated by M2 ·

At a glance — Readiness · 55.0 · Adequate · gated by P3 ·

At a glance — Security · 73.7 · Adequate · gated by D36 ·

At a glance — Domain Modelling · 86.5 · Exemplary ·

At a glance — Performance · 100.0 · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures9High / Critical
A05:2025 — Injection8High / Critical

Roadmap

Top priorities: Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing; Resolve the 1 Banned license finding(s) in License Compliance; Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.

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

Do thisHelpsEffortDimension
Resolve the 1 Banned license finding(s) in License Compliance.+4.6 ptsLowLicense Compliance
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+7.0 ptsMediumSecurity & performance tooling
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.+3.7 ptsMediumDeployment & Rollback
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+2.6 ptsMediumArchitecture documentation
Resolve the 47 No assertions finding(s) in Test Quality — start with W8A8KernelTests.swift (12), QuantizedMapTests.swift (7), CapacityEngineLedgerTests.swift (5).+2.6 ptsMediumTest Quality
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.+1.4 ptsMediumDocumentation (README)
Swallowed exception (caught, then discarded)+1.0 ptsMediumException handling
Resolve the 68 Hotspot finding(s) in Churn × Complexity Hotspots — start with WeightProducts.swift, Errors.swift, Problems.swift.+0.6 ptsHighChurn × Complexity Hotspots

File quality

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

FileScoreBandWorst signal
REDACTED3.7MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
Sources/SiliconedApp/PromptField.swift4.8MixedCyclomatic Complexity: PromptTextView.varyTarget (cyclomatic 17)
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
Sources/Siliconed/Conductor.swift5.1MixedCode Duplication: Edited copy of a member (14 corresponding lines)
Sources/Siliconed/Errors.swift5.6MixedCyclomatic Complexity: EngineError.errorDescription (cyclomatic 77)
Sources/Siliconed/Block.swift5.7MixedCyclomatic Complexity: Block.forwardStreamed (cyclomatic 16)
Sources/Siliconed/MemoryNeedKrea2.swift5.7MixedCode Duplication: Edited copies of one member (6 members, 7+ corresponding lines)
Sources/Siliconed/DecodeKernels.swift5.9MixedCode Duplication: Edited copy of a member (11 corresponding lines)
Sources/SiliconedApp/AppState+Catalog.swift6.3Near-cleanCyclomatic Complexity: AppState.formBlocker (cyclomatic 20)
Sources/Siliconed/CapacityPlan.swift7.0Near-cleanCyclomatic Complexity: CapacityPlan.forcing (cyclomatic 75)
Sources/SiliconedApp/RemoteControl+Add.swift7.0Near-cleanCyclomatic Complexity: RemoteControl.add (cyclomatic 73)
Sources/Siliconed/WeightProducts.swift7.0Near-cleanCyclomatic Complexity: WeightProducts.linear (cyclomatic 65)
Sources/Siliconed/CapacitySolver.swift7.0Near-cleanCyclomatic Complexity: ProductSolver.widened (cyclomatic 42)
Sources/Siliconed/CapacityFit.swift7.0Near-cleanCyclomatic Complexity: CapacityFit.model (cyclomatic 39)
Sources/Siliconed/QwenImage21.swift7.0Near-cleanCyclomatic Complexity: QwenImage21DiT.body (cyclomatic 38)
Sources/SiliconedApp/AppState+Render.swift7.0Near-cleanCyclomatic Complexity: AppState.execute (cyclomatic 33)
Sources/Siliconed/Krea2.swift7.0Near-cleanCyclomatic Complexity: Krea2DiT.blockStreamed (cyclomatic 22)
Sources/Siliconed/Widen.swift7.0Near-cleanCyclomatic Complexity: Widen.dequantizePacked (cyclomatic 19)
Sources/Siliconed/QwenImage21VAE.swift7.0Near-cleanCyclomatic Complexity: QwenImage21VAE.run (cyclomatic 16)

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

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

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

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

Could not be resolved — 28

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 44 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

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

What we checked — 44 dimensions across the health lenses
D1D2D3D4D5D6D10D12D13D14D15D17D19D26D27D28D29D30D34D35D36D43D44AX10AX3AX4AX6AX8AX9DM4DM5M1M2M3M4P1P2P3P4P6PF3X26X28X3

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, 856 of 875 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e92e-10d2-741a-a3da-c4f927d53d4a.

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

Run transparency — what happened this run

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

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Swift half could not be measured — the Swift suite in . produced no coverage export. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.swift) and this repository declares a SwiftPM test suite (Siliconed), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • 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 a Swift Package.swift/Package.resolved, but the licence verdict published here was taken over its Python distribution dependencies. Nothing was read about its SwiftPM 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-contributor repository — bus factor is not applicable (1 contributor(s) across 479 commit(s) sampled, automation and bot accounts excluded). Concentration needs a team to concentrate: with one contributor there is nobody to spread the knowledge to, so there is nothing here for the owner to act on.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • D24 Comment Value — 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 the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • 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. `Sources/Measurement/Probes.swift`, `Sources/Measurement/Runner.swift`, `Sources/Measurement/Series.swift`, `Sources/Siliconed/Anima.swift`, `Sources/Siliconed/AnimaConditioner.swift`, … (+211 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 Sources/Siliconed/Remote/Frames.swift, 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.
  • 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.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Java was found, and this repository's Swift, c is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby, Scala or Rust was found, and this repository's Swift, c is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — not measured this run — 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.
  • X1 Async correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala, Rust and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala, Rust or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala, Kotlin, Java and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala, Kotlin, Java or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X13 Undrained process stream — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Python, Dart, Ruby, Scala, Kotlin, Rust and Java source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala, Kotlin, Rust or Java was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X15 Unvalidated length from an untrusted reader — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Ruby, Python, Go, Rust, Dart, F# and Elixir source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Ruby, Python, Go, Rust, Dart, F# or Elixir was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X17 Uncapped recursion over a caller-supplied document — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Python, Dart, Ruby, Scala, Kotlin and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, Python, Dart, Ruby, Scala, Kotlin or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust and Elixir source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust or Elixir was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X2 Cancellation propagation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X22 Contradicted release guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# and Visual Basic syntax, and Java, TypeScript/JavaScript, Python, Dart, Ruby, Scala, Kotlin, PHP, F#, Rust and Visual Basic source only, and no C# was loaded, and this repository's C, Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X23 Unguarded diagnostic materialisation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin, PHP and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, F#, Python, Dart, Ruby, Scala, Kotlin, PHP or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X25 Inert configuration knob — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart, Ruby and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Scala, PHP, Erlang, Python, Dart, Ruby or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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 reads C# syntax, and Java, Rust, Erlang, F#, Python, Dart, Ruby, Scala, Kotlin, PHP and Go source only, and no C# was loaded, no Java, Rust, Erlang, F#, Python, Dart, Ruby, Scala, Kotlin, PHP or Go was found, and this repository's C is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript (Vue and Svelte components included), Java, Rust, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X30 Support guard that admits what it rejects — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Scala, JavaScript/TypeScript, Java, Kotlin, Python, PHP, Go, Rust, Dart, Ruby and Erlang source only, and no C# was loaded and no Scala, JavaScript, TypeScript, Java, Kotlin, Python, PHP, Go, Rust, Dart, Ruby or Erlang was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's C, Swift is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • 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.
  • 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 REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (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.
  • 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.
  • DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
  • 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".
  • 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 Complexity4.7 / 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 4.7 / 10 · rule-coverage 100% · ceiling Prevented

159 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was QuantizedLayouts.recognize at 124. A further 9 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 EngineError.recoverySuggestion at 61 — 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: Sources/SiliconedApp/MirrorRefusal.swift (AppRefusal.sentence at 25), Sources/Siliconed/Forge/Management.swift (Family.installedSize at 18), Sources/SiliconedApp/DiagnosticSheet.swift (ReportView.label at 18), Sources/SiliconedApp/Grid.swift (GridWords.command at 16). 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.

QuantizedLayouts.recognize (cyclomatic 124)Sources/Siliconed/Forge/Quantization.swift:430
GestureOrder.parse (cyclomatic 120)Sources/Siliconed/RemoteGestures.swift:232
ForgeLoRA.forging (cyclomatic 88)Sources/Siliconed/Forge/ForgeLoRA.swift:420
EngineError.errorDescription (cyclomatic 77)Sources/Siliconed/Errors.swift:276
Problem.sentence (cyclomatic 77)Sources/SiliconedApp/Problems.swift:56

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

What to do

  1. Bring the 10 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with QuantizedLayouts.recognize (cyclomatic 124), GestureOrder.parse (cyclomatic 120), ForgeLoRA.forging (cyclomatic 88). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 10 together lifts Cyclomatic Complexity from 4.7 to about 5.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.1 / 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.1 / 10 · rule-coverage 100% · ceiling Prevented

234 method(s) exceeded the cognitive complexity threshold of 15; the worst was QuantizedLayouts.recognize at 201.

QuantizedLayouts.recognize (cognitive 201)Sources/Siliconed/Forge/Quantization.swift:430
GestureOrder.parse (cognitive 176)Sources/Siliconed/RemoteGestures.swift:232
ForgeLoRA.forging (cognitive 139)Sources/Siliconed/Forge/ForgeLoRA.swift:420
Context.attention (cognitive 108)Sources/Siliconed/CapacityProbesSolos.swift:322
CapacityPlan.forcing (cognitive 107)Sources/Siliconed/CapacityPlan.swift:756

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

What to do

  1. Bring the 3 bodies over 120 down to 120 or less in Cognitive Complexity — start with QuantizedLayouts.recognize (cognitive 201), GestureOrder.parse (cognitive 176), ForgeLoRA.forging (cognitive 139). — 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 3 together lifts Cognitive Complexity from 2.1 to about 3.3/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

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

D3 · God Classes8.0 / 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.0 / 10 · rule-coverage 100% · ceiling Prevented

46 god class(es) detected.

MethodTooLong: QuantizedLayouts.recognize · ×25Sources/Siliconed/Forge/Quantization.swift:430
FileTooLong: SilicontrolHelp/RemoteControlHelp.swift · ×11Sources/SilicontrolHelp/RemoteControlHelp.swift
TooManyMethods: AppState · ×8Sources/SiliconedApp/AppState.swift:42
ClassTooLong: MirrorServer · ×2Sources/SiliconedApp/MirrorServer.swift:26

What to do

  1. Resolve the 25 MethodTooLong finding(s) in God Classes — start with Problems.swift (2), Quantization.swift, ForgeLoRA.swift. — One of this dimension's main actionable groups (25 warning-level).
  2. Resolve the 11 FileTooLong finding(s) in God Classes — start with RemoteControlHelp.swift, QwenImage21.swift, Krea2.swift. — One of this dimension's main actionable groups (11 warning-level).
  3. Resolve the 8 TooManyMethods finding(s) in God Classes — start with AppState.swift, RemoteControl.swift, Library.swift. — One of this dimension's main actionable groups (8 warning-level).

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

D4 · Code Duplication8.4 / 10Strong✓ 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 8.4 / 10 · rule-coverage 100% · ceiling Verified

92 duplicated block group(s) detected. 4.1 % of the production lines (3,846 of 94,184) are in a reported copy. A further 146 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 40 of the 238 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.

Duplicated block (5 lines × 2) · ×28Sources/Siliconed/CapacityPlan.swift:249
Edited copy of a member (7 corresponding lines) · ×15Sources/Siliconed/GEMM.swift:386
Duplicated block (8 lines × 2) · ×13Sources/Siliconed/DiagnosticJudgement.swift:64
Edited copy of a member (3 corresponding lines) · ×12Sources/Siliconed/DiagnosticProbes.swift:82
Edited copy of a member (9 corresponding lines) · ×11Sources/Siliconed/ModulesKrea2.swift:65

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

What to do

  1. Resolve the 28 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with RackDiT.swift (2), NeuralEngine.swift (2), anima.py (2). — One of this dimension's main actionable groups (28 warning-level).
  2. Resolve the 15 Edited copy of a member (7 corresponding lines) finding(s) in Code Duplication — start with GEMM.swift (2), ElementwiseGPU.swift, Detail.swift. — One of this dimension's main actionable groups (15 warning-level).
  3. Resolve the 13 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with anima.py (2), krea2.py (2), DiagnosticJudgement.swift. — One of this dimension's main actionable groups (13 warning-level).

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

D5 · Coupling8.0 / 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.0 / 10 · rule-coverage 100% · ceiling Prevented

8 production modules (SwiftPM), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 2 module(s) off the main sequence, with abstractness counted on 7 of the 8 (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: Measurement · ×2

What to do

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

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

D6 · Cohesion (LCOM4)9.5 / 10Stronggated by 4 serious findings✓ 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.5 / 10 · rule-coverage 100% · ceiling Verified

4 of 104 classes have LCOM4 above 3.

Low cohesion: DecodeKernels (LCOM4 8) · ×4Sources/Siliconed/DecodeKernels.swift:38

What to do

  1. Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with PromptField.swift (2), DecodeKernels.swift, LabView.swift. — One of this dimension's main actionable groups (4 warning-level).

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

D10 · Test Quality9.3 / 10Stronggated by 57 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 9.3 / 10 · rule-coverage 100% · ceiling Prevented

10 skipped, 47 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 1326 tests.

No assertions: testZImage · ×47Tests/SiliconedTests/CapacityEngineLedgerTests.swift:200
Skipped test: testFasterRenderingIsTheRequestsAndReachesThePlan · ×10Tests/SiliconedTests/AdmissionTests.swift:46

What to do

  1. Resolve the 47 No assertions finding(s) in Test Quality — start with W8A8KernelTests.swift (12), QuantizedMapTests.swift (7), CapacityEngineLedgerTests.swift (5). — One of this dimension's main actionable groups (47 warning-level).
  2. Resolve the 10 Skipped test finding(s) in Test Quality — start with AdmissionTests.swift (2), NeuralEngineTests.swift (2), PlanReadsNoSettingsTests.swift (2). — One of this dimension's main actionable groups (10 warning-level).

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

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

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

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

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

10 outdated, 0 yanked pinned Python distributions. Only EXACT pins are graded for currency: a floor or a range already installs the newest release it admits, so reporting one would report this repository for being current. Whether a deliberate upper cap has itself gone stale is a different and weaker question, and is not asked. Whether any distribution is UNMAINTAINED is not graded — PyPI publishes no maintenance status, and release age does not stand in for one. Lockfiles are not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock), so a lock-resolved install is outside this verdict. Known CVEs in this dependency graph are D30's question.

Outdated: accelerate · ×10

✓ On the Gold path — maintain.

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance8.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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 8.0 / 10 · rule-coverage 100% · ceiling Verified

1 of 68 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 13 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (55 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 9 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's Python distribution dependencies and nothing else. The repository also declares a Swift Package.swift/Package.resolved, 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.

Banned license: sdnq

What to do

  1. Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).

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

D15 · Churn × Complexity Hotspots9.5 / 10Stronggated by 68 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.5 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: Sources/Siliconed/WeightProducts.swift (33×65=2145); Sources/Siliconed/Errors.swift (23×77=1771); Sources/SiliconedApp/Problems.swift (23×77=1771)

Hotspot: Sources/Siliconed/WeightProducts.swift · ×68Sources/Siliconed/WeightProducts.swift:278

What to do

  1. Resolve the 68 Hotspot finding(s) in Churn × Complexity Hotspots — start with WeightProducts.swift, Errors.swift, Problems.swift. — One of this dimension's main actionable groups (68 warning-level).

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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

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

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

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

1 of 1 documentation facets pass in full. 10 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D26 · Project Cohesion0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 2 build units (Python, SwiftPM) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionPackage.swift:1

What to do

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

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

D27 · Navigability9.6 / 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 9.6 / 10 · rule-coverage 100% · ceiling Documented

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

✓ 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)9.5 / 10Adequategated by 7 critical findings✓ 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 9.5 / 10 · rule-coverage 100% · ceiling Documented

8 finding(s): 0 critical, 7 high, 1 medium, 0 low. 7 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `tools/app.sh` (line 74, line 92, line 142) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED

What to do

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

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

D30 · Dependency Vulnerabilities8.8 / 10Adequategated by 2 critical 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 8.8 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED

What to do

  1. Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).

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

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 293 of the 306 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 Coupling9.2 / 10Stronggated by 9 serious findings✓ 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 9.2 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: AppState+Diagnostic.swift↔DiagnosticSheet.swift 87%; RemoteControl+Commands.swift↔RemoteControlHelp.swift 83%; MemoryNeedKrea2.swift↔MemoryNeedQwenImage21.swift 80%

Change coupling: AppState+Diagnostic.swift ↔ DiagnosticSheet.swift · ×7Sources/SiliconedApp/AppState+Diagnostic.swift:1
Change-coupling hub: RemoteControlHelp.swift → RemoteControl+Add.swift, RemoteControl+Commands.swift, SettingsWindow.swift · ×2Sources/SilicontrolHelp/RemoteControlHelp.swift

What to do

  1. Resolve the 7 Change coupling finding(s) in Change Coupling — start with Conductor.swift (2), AppState+Diagnostic.swift, MemoryNeedKrea2.swift. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 2 Change-coupling hub finding(s) in Change Coupling — start with RemoteControlHelp.swift, Block.swift. — One of this dimension's main actionable groups (2 warning-level).

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

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. 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).
  3. 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).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.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-Life10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 0 platform declaration(s) and 13 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

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

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

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

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

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

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.

DM4 · Rich vs anemic domain model7.6 / 10Strong✓ Tool-verified

Other · Domain Modelling — Whether domain entities own their behaviour — a data-only reference entity whose logic lives in a foreign service is anemic. Rich models enforce their own invariants.

Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.

Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.

  • `Cancellation` is a data-only reference entity whose behaviour is DELEGATED to a foreign utility (static methods that take it as their first parameter and hold its logic) — the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants rather than being driven from outside. — Sources/Siliconed/Cancellation.swift:27

What to do

  • Move delegated behaviour onto the domain entity (or make it a value object); keep invariants inside the type.
DM5 · Encapsulated state10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether a reference entity protects its own invariants — a class whose identity is a computed content hash but whose hashed fields are publicly mutable bypasses that invariant. Encapsulated state keeps identity-bearing fields immutable.

Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.

Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.

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

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

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

What to do

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

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

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

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

What to do

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

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

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

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

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

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

P1 · CI/CD 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.

P2 · Observability7.0 / 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.

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

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

What to do

  • Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ 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.

What to do

  • Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
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.

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ 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.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

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

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

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

X3 · Exception handling6.6 / 10Strong✓ Tool-verified

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

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

  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×5) — Sources/Siliconed/Catalog.swift:284, Sources/Siliconed/DiagnosticMachine.swift:199, Sources/Siliconed/DiagnosticWideningProbes.swift:38, …
  • 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. (×3) — Sources/Siliconed/RenderCache.swift:260, Sources/Siliconed/Forge/HubLink.swift:241, Sources/Measurement/Runner.swift:66

What to do

  • Swallowed exception (caught, then discarded)

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 Health70.9Adequate — gated by D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90.3Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity66.7Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness55.0Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security73.7Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling86.5ExemplarySolid.
Performance100.0ExemplaryStrongest area.
Unscored — 2 check(s) recorded observations but carry no score

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

  • X10 Duplicated predicate — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for

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

  • 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.
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 73 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • 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. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • 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.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named property (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a SwiftData @Model, a Core Data, Realm, GRDB or Fluent type, a GRDB or SQLite.swift column, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (CoreData, SwiftData, GRDB, RealmSwift, SQLite, Firebase, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named property (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a SwiftData @Model, a Core Data, Realm, GRDB or Fluent type, a GRDB or SQLite.swift column, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (CoreData, SwiftData, GRDB, RealmSwift, SQLite, Firebase, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not included — the .swift suite was found but not re-run
  • D16 Bus Factor — single-contributor 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.
  • D20 ADR Quality — N/A — this repo declares itself a template / kata / sample / demo; a formal ADR log is deferred to a real application built from it.
  • D21 Naming Consistency — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, .swift, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 216 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — Swift suite
  • DM1 Aggregate boundaries — not scored for Swift: the sidecar flattens array/collection types (a child COLLECTION = legitimate membership vs a single embedded aggregate is indistinguishable), and aggregate-vs-value-object classification cannot be told apart in source (every struct-holding-struct reads alike) — reported as guidance rather than measured
  • DM2 Strongly-typed ids — no in-repo typed-id idiom — primitive-obsession recorded as advisory DM8, DM2 not gated
  • DM3 Integration-event coupling — not scored for Swift: a cross-SwiftPM-target domain leak cannot be told apart in source from a legitimate shared-kernel/contracts module, and most repositories ship a single module — reported as guidance rather than measured
  • DM6 Domain ↔ infrastructure boundary — this Swift package maps no type to a persistence framework and declares no domain-model type carrying a method of its own, so DM6's domain↔infrastructure boundary read has no population to be taken over
  • DM7 Repository granularity — not scored for Swift: 'a repository per CHILD entity' needs the aggregate-root structure, which is not source-resolvable — reported as guidance rather than measured
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Swift source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `Benchmark("…")` in a file importing package-benchmark, or package-benchmark in Package.swift, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • 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.
  • X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X12 Unreachable branch — 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
  • X13 Undrained process stream — 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
  • 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 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
  • X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X17 Uncapped recursion over a caller-supplied document — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • 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
  • X2 Cancellation propagation — 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
  • 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.
  • X21 Side-effecting pattern guard — Not applicable: this check looks for a pattern guard or `case` label that increments, decrements or assigns while the switch is deciding whether it matches, and in this repository's languages none can. In C a `case` label must be a constant expression, and a switch has no guards, so no label can change state. Swift has no `++` or `--`, and an assignment yields `()`, which cannot be an operand of `&&`, `||` or `?:` nor the Bool a `case … where` clause needs. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — 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
  • X23 Unguarded diagnostic materialisation — 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
  • X24 Document value interpolated into markup unescaped — 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
  • X25 Inert configuration knob — 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
  • X27 Collection changed while being enumerated — 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
  • X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X30 Support guard that admits what it rejects — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Swift was read, and it logs through none: `print` and `NSLog` take one finished line, and os's `Logger` keeps each interpolated value as its own argument, so an assembled message there loses nothing the API could have kept (as with log4net in C#). Calls through swift-log (`import Logging`) and `os_log` calls would be judged.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 11 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×2
  • REDACTED
  • REDACTED
D14 · License Compliance · Banned license · ×1
  • Banned license: sdnq — `sdnq` 0.2.9 is published on PyPI under `GPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
DM4 · Rich vs anemic domain model · Anemic domain model · ×1
  • Anemic domain model: Cancellation Sources/Siliconed/Cancellation.swift:27 — `Cancellation` is a data-only reference entity whose behaviour is DELEGATED to a foreign utility (static methods that take it as their first parameter and hold its logic) — the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants rather than being driven from outside.
Serious — 829 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×68
  • Hotspot: Sources/Siliconed/WeightProducts.swift Sources/Siliconed/WeightProducts.swift:278 — Sources/Siliconed/WeightProducts.swift changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in WeightProducts.linear at line 278. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/WeightProducts.swift`: 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: Sources/Siliconed/Errors.swift Sources/Siliconed/Errors.swift:276 — Sources/Siliconed/Errors.swift changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in EngineError.errorDescription at line 276. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Errors.swift`: 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: Sources/SiliconedApp/Problems.swift Sources/SiliconedApp/Problems.swift:56 — Sources/SiliconedApp/Problems.swift changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Problem.sentence at line 56. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/Problems.swift`: 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: Sources/Siliconed/CapacityPlan.swift Sources/Siliconed/CapacityPlan.swift:756 — Sources/Siliconed/CapacityPlan.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in CapacityPlan.forcing at line 756. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/CapacityPlan.swift`: 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: Sources/SiliconedApp/RemoteControl.swift Sources/SiliconedApp/RemoteControl.swift:78 — Sources/SiliconedApp/RemoteControl.swift changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in RemoteControl.handle at line 78. 1 of those changes was a fix/bug commit, and the other 40 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/RemoteControl.swift`: 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: Sources/SiliconedApp/RemoteControl+Add.swift Sources/SiliconedApp/RemoteControl+Add.swift:121 — Sources/SiliconedApp/RemoteControl+Add.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in RemoteControl.add at line 121. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/RemoteControl+Add.swift`: 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: Sources/SiliconedApp/AppState+Mirror.swift Sources/SiliconedApp/AppState+Mirror.swift:266 — Sources/SiliconedApp/AppState+Mirror.swift changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in AppState.receive at line 266. 1 of those changes was a fix/bug commit, and the other 20 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/AppState+Mirror.swift`: 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: Sources/SiliconedApp/AppState+Render.swift Sources/SiliconedApp/AppState+Render.swift:359 — Sources/SiliconedApp/AppState+Render.swift changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AppState.execute at line 359. 1 of those changes was a fix/bug commit, and the other 33 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/AppState+Render.swift`: 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: Sources/Siliconed/QwenImage21.swift Sources/Siliconed/QwenImage21.swift:452 — Sources/Siliconed/QwenImage21.swift changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in QwenImage21DiT.body at line 452. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/QwenImage21.swift`: 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: Sources/Siliconed/CapacitySolver.swift Sources/Siliconed/CapacitySolver.swift:375 — Sources/Siliconed/CapacitySolver.swift changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ProductSolver.widened at line 375. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/CapacitySolver.swift`: 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: Sources/SiliconedApp/App.swift Sources/SiliconedApp/App.swift:546 — Sources/SiliconedApp/App.swift changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MainWindow.watchKeys at line 546. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/App.swift`: 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: Sources/Siliconed/CapacityProbesSolos.swift Sources/Siliconed/CapacityProbesSolos.swift:194 — Sources/Siliconed/CapacityProbesSolos.swift changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Context.solo at line 194. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/CapacityProbesSolos.swift`: 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: Sources/Siliconed/Forge/Quantization.swift Sources/Siliconed/Forge/Quantization.swift:430 — Sources/Siliconed/Forge/Quantization.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in QuantizedLayouts.recognize at line 430. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Forge/Quantization.swift`: 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: Sources/Siliconed/Forge/Families.swift Sources/Siliconed/Forge/Families.swift:345 — Sources/Siliconed/Forge/Families.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Recipes.normalize at line 345. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Forge/Families.swift`: 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: Sources/Siliconed/Artifact.swift Sources/Siliconed/Artifact.swift:280 — Sources/Siliconed/Artifact.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Artifact.parse at line 280. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Artifact.swift`: 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: Sources/Siliconed/Forge/ForgeLoRA.swift Sources/Siliconed/Forge/ForgeLoRA.swift:420 — Sources/Siliconed/Forge/ForgeLoRA.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ForgeLoRA.forging at line 420. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Forge/ForgeLoRA.swift`: 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: Sources/Siliconed/Krea2.swift Sources/Siliconed/Krea2.swift:451 — Sources/Siliconed/Krea2.swift changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Krea2DiT.blockStreamed at line 451. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Krea2.swift`: 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: Sources/Siliconed/Forge/Installation.swift Sources/Siliconed/Forge/Installation.swift:536 — Sources/Siliconed/Forge/Installation.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Installer.install at line 536. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/Forge/Installation.swift`: 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: Sources/SiliconedApp/RemoteControl+Mirror.swift Sources/SiliconedApp/RemoteControl+Mirror.swift:74 — Sources/SiliconedApp/RemoteControl+Mirror.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in RemoteControl.addOnMirror at line 74. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/SiliconedApp/RemoteControl+Mirror.swift`: 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: Sources/Siliconed/CapacityFit.swift Sources/Siliconed/CapacityFit.swift:687 — Sources/Siliconed/CapacityFit.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in CapacityFit.model at line 687. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/CapacityFit.swift`: 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: Sources/Siliconed/RemoteGestures.swift Sources/Siliconed/RemoteGestures.swift:232 — Sources/Siliconed/RemoteGestures.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in GestureOrder.parse at line 232. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/RemoteGestures.swift`: 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: Sources/Siliconed/GEMM.swift Sources/Siliconed/GEMM.swift:297 — Sources/Siliconed/GEMM.swift changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GEMM.linear at line 297. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/GEMM.swift`: 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: Sources/Siliconed/EngineSettings.swift Sources/Siliconed/EngineSettings.swift:256 — Sources/Siliconed/EngineSettings.swift changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EngineSettings.init at line 256. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/EngineSettings.swift`: 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: Sources/Siliconed/NeuralEngine.swift Sources/Siliconed/NeuralEngine.swift:284 — Sources/Siliconed/NeuralEngine.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NeuralEngine.run at line 284. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/NeuralEngine.swift`: 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: Sources/Siliconed/EngineRender.swift Sources/Siliconed/EngineRender.swift:52 — Sources/Siliconed/EngineRender.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Engine.execute 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 11:07:33 +01:00' --until='2026-11-08 11:07:33 +01:00' --full-history --no-merges -- Sources/Siliconed/EngineRender.swift`: 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.
  • + 43 more in this group — see findings.md.
D10 · Test Quality · No assertions · ×47
  • No assertions: testZImage Tests/SiliconedTests/CapacityEngineLedgerTests.swift:200 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testQwenImage21 Tests/SiliconedTests/CapacityEngineLedgerTests.swift:201 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testAnima Tests/SiliconedTests/CapacityEngineLedgerTests.swift:202 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testKrea2 Tests/SiliconedTests/CapacityEngineLedgerTests.swift:203 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testMossImage Tests/SiliconedTests/CapacityEngineLedgerTests.swift:204 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testTheThreeChainsOfTheRepositoryPlugIn Tests/SiliconedTests/ChainTests.swift:10 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testALoRAOfTheRightTargetIsAccepted Tests/SiliconedTests/ChainTests.swift:63 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testFitFallsBackWhereTheFloorLeavesNoRoom Tests/SiliconedTests/CropTests.swift:142 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testRandomDragsNeverBreakTheRules Tests/SiliconedTests/CropTests.swift:156 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testBlockScalesOverSeveralJobs Tests/SiliconedTests/DequantizeTests.swift:79 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testColumnScalesOverSeveralJobs Tests/SiliconedTests/DequantizeTests.swift:97 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testTensorScaleAndPlainCastOverSeveralJobs Tests/SiliconedTests/DequantizeTests.swift:113 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testRowScalesOverSeveralJobs Tests/SiliconedTests/DequantizeTests.swift:127 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testSafetensorsTooShortIsNamedNotUnopenable Tests/SiliconedTests/HostileFilesTests.swift:53 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testSafetensorsHeaderLengthIsBounded Tests/SiliconedTests/HostileFilesTests.swift:59 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testSafetensorsOffsetsAndShapesAreBounded Tests/SiliconedTests/HostileFilesTests.swift:66 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testGGUFHugeCountsAreRefusedBeforeReading Tests/SiliconedTests/HostileFilesTests.swift:106 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testGGUFOverflowingDimensionsAreRefused Tests/SiliconedTests/HostileFilesTests.swift:115 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testQ4KBlocksAgainstFP64 Tests/SiliconedTests/KQuantKernelTests.swift:78 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testQ5KBlocksAgainstFP64 Tests/SiliconedTests/KQuantKernelTests.swift:79 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testFP8ScaledPerTensorComfyUI Tests/SiliconedTests/QuantizedMapTests.swift:220 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testFP8PerRowTorchao Tests/SiliconedTests/QuantizedMapTests.swift:233 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testInt8PerRowBF16SDNQ Tests/SiliconedTests/QuantizedMapTests.swift:240 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testInt8PerRowF32Torchao Tests/SiliconedTests/QuantizedMapTests.swift:245 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: testInt8PerRowComfyUI Tests/SiliconedTests/QuantizedMapTests.swift:254 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • + 22 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×28
  • Duplicated block (5 lines × 2) Sources/Siliconed/CapacityPlan.swift:249 — Sources/Siliconed/CapacityPlan.swift:249-253 | Sources/Siliconed/CapacityPlan.swift:270-274 — 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 `Sources/Siliconed/CapacityPlan.swift:249` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/Siliconed/CapacityProbesSolos.swift:35 — Sources/Siliconed/CapacityProbesSolos.swift:35-39 | Sources/Siliconed/CapacityProbesSolos.swift:181-185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/Siliconed/DiagnosticProbes.swift:150 — Sources/Siliconed/DiagnosticProbes.swift:150-154 | Sources/Siliconed/TensorGEMMInt8.swift:209-213 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/DiagnosticProbes.swift:150` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/MemoryNeedAnima.swift:153 — Sources/Siliconed/MemoryNeedAnima.swift:153-157 | Sources/Siliconed/MemoryNeedKrea2.swift:187-191 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/MemoryNeedAnima.swift:153` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind `maps` to `AnimaMaps` in one and `Krea2Maps` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) Sources/Siliconed/MemoryNeedKrea2.swift:336 — Sources/Siliconed/MemoryNeedKrea2.swift:336-340 | Sources/Siliconed/MemoryNeedMossImage.swift:84-88 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/MemoryNeedKrea2.swift:336` 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.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Qwen35.swift:480 — Sources/Siliconed/Qwen35.swift:480-484 | Sources/Siliconed/TextEncoder.swift:420-425 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Qwen35.swift:480` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Remote/Installing.swift:251 — Sources/Siliconed/Remote/Installing.swift:251-255 | Sources/SiliconedApp/MirrorLibrary.swift:178-182 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Remote/Installing.swift:251` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/WeightProducts.swift:679 — Sources/Siliconed/WeightProducts.swift:679-683 | Sources/Siliconed/WeightProducts.swift:723-727 — 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 `Sources/Siliconed/WeightProducts.swift:679` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Widen.swift:224 — Sources/Siliconed/Widen.swift:224-228 | Sources/Siliconed/Widen.swift:251-255 — 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 `Sources/Siliconed/Widen.swift:224` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/SiliconedApp/Lab.swift:590 — Sources/SiliconedApp/Lab.swift:590-594 | Sources/SiliconedApp/SubjectSheet.swift:172-176 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (5 lines × 2) Sources/SiliconedApp/RackDiT.swift:385 — Sources/SiliconedApp/RackDiT.swift:385-389 | Sources/SiliconedApp/Welcome.swift:170-176 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind `spacing` to `2` in one and `3` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) Sources/SiliconedApp/RemoteControl+Follow.swift:36 — Sources/SiliconedApp/RemoteControl+Follow.swift:36-42 | Sources/SiliconedApp/RemoteControl+Follow.swift:151-155 — 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 `Sources/SiliconedApp/RemoteControl+Follow.swift:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Anima.swift:64 — Sources/Siliconed/Anima.swift:64-68 | Sources/Siliconed/QwenImage21.swift:66-70 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Anima.swift:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/CapacityProbesValidation.swift:46 — Sources/Siliconed/CapacityProbesValidation.swift:46-50 | Sources/Siliconed/CapacityProbesValidation.swift:76-80 — 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 `Sources/Siliconed/CapacityProbesValidation.swift:46` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/DecodeKernels.swift:398 — Sources/Siliconed/DecodeKernels.swift:398-402 | Sources/Siliconed/ElementwiseGPU.swift:302-306 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/DecodeKernels.swift:398` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Krea2.swift:409 — Sources/Siliconed/Krea2.swift:409-413 | Sources/Siliconed/Krea2.swift:422-426 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) Sources/Siliconed/MossImage.swift:412 — Sources/Siliconed/MossImage.swift:412-416 | Sources/Siliconed/MossImage.swift:427-431 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) Sources/Siliconed/NeuralEngine.swift:347 — Sources/Siliconed/NeuralEngine.swift:347-351 | Sources/Siliconed/NeuralEngine.swift:400-404 — 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 `Sources/Siliconed/NeuralEngine.swift:347` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/NeuralEngine.swift:613 — Sources/Siliconed/NeuralEngine.swift:613-617 | Sources/Siliconed/NeuralEngine.swift:625-629 — 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 `Sources/Siliconed/NeuralEngine.swift:613` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Ops.swift:24 — Sources/Siliconed/Ops.swift:24-28 | Sources/Siliconed/Ops.swift:124-128 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) Sources/Siliconed/Tokenizer.swift:94 — Sources/Siliconed/Tokenizer.swift:94-98 | Sources/Siliconed/Tokenizer.swift:226-230 — 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 `Sources/Siliconed/Tokenizer.swift:94` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/SiliconedApp/DiagnosticSheet.swift:258 — Sources/SiliconedApp/DiagnosticSheet.swift:258-262 | Sources/SiliconedApp/DiagnosticSheet.swift:380-384 — 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 `Sources/SiliconedApp/DiagnosticSheet.swift:258` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/SiliconedApp/RackDiT.swift:254 — Sources/SiliconedApp/RackDiT.swift:254-258 | Sources/SiliconedApp/RackDiT.swift:264-268 — 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 `Sources/SiliconedApp/RackDiT.swift:254` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) Sources/Verification/QwenImageStages.swift:349 — Sources/Verification/QwenImageStages.swift:349-353 | Sources/Verification/QwenImageStages.swift:356-360 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `channels` to `Int` in one and `Int = 64` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) tools/oracle/anima.py:628 — tools/oracle/anima.py:628-632 | tools/oracle/krea2.py:973-978 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • + 3 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×25
  • MethodTooLong: QuantizedLayouts.recognize Sources/Siliconed/Forge/Quantization.swift:430 — MethodTooLong — recognize runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× 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: ForgeLoRA.forging Sources/Siliconed/Forge/ForgeLoRA.swift:420 — MethodTooLong — forging runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89× 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: RemoteControl.add Sources/SiliconedApp/RemoteControl+Add.swift:121 — MethodTooLong — add runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× 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: Engine.execute Sources/Siliconed/EngineRender.swift:52 — MethodTooLong — execute runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73× 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: Qwen3VLGenerator.generate Sources/Siliconed/Qwen3VLGeneration.swift:259 — MethodTooLong — generate runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× 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: NeuralEngine.run Sources/Siliconed/NeuralEngine.swift:284 — MethodTooLong — run runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× 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: FlashMatrix.source Sources/Siliconed/FlashMatrix.swift:100 — MethodTooLong — source runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× 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: Problem.sentence Sources/SiliconedApp/Problems.swift:56 — MethodTooLong — sentence 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.
  • MethodTooLong: GestureOrder.parse Sources/Siliconed/RemoteGestures.swift:232 — MethodTooLong — parse runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32× 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: WeightProducts.linear Sources/Siliconed/WeightProducts.swift:278 — MethodTooLong — linear 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.
  • MethodTooLong: RemoteControl.addOnMirror Sources/SiliconedApp/RemoteControl+Mirror.swift:74 — MethodTooLong — addOnMirror runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× 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: Context.attention Sources/Siliconed/CapacityProbesSolos.swift:322 — MethodTooLong — attention runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.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: AppState.receive Sources/SiliconedApp/AppState+Mirror.swift:266 — MethodTooLong — receive 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: Attention.init Sources/Siliconed/Attention.swift:106 — MethodTooLong — init 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.
  • MethodTooLong: DiT.forward Sources/Siliconed/DiT.swift:191 — MethodTooLong — forward runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× 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: GGUF.parse Sources/Siliconed/Forge/GGUF.swift:90 — MethodTooLong — parse runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× 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: AppState.execute Sources/SiliconedApp/AppState+Render.swift:359 — MethodTooLong — execute 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.
  • MethodTooLong: Runner.run Sources/Measurement/Runner.swift:27 — MethodTooLong — run 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: Diagnostic.measureWidening Sources/Siliconed/DiagnosticWideningProbes.swift:28 — MethodTooLong — measureWidening runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.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.
  • MethodTooLong: Installer.install Sources/Siliconed/Forge/Installation.swift:536 — MethodTooLong — install runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.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.
  • MethodTooLong: EngineError.errorDescription Sources/Siliconed/Errors.swift:276 — MethodTooLong — errorDescription runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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: Problem.suggestion Sources/SiliconedApp/Problems.swift:202 — MethodTooLong — suggestion runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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: AppCommands.body Sources/SiliconedApp/App.swift:53 — MethodTooLong — body runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× 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: TiledAttention.fusedSource Sources/Siliconed/TiledAttention.swift:491 — MethodTooLong — fusedSource runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× 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: HeadSplitAttention.init Sources/Siliconed/HeadSplitAttention.swift:212 — MethodTooLong — init runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× 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.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×15
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/GEMM.swift:386 — Sources/Siliconed/GEMM.swift:386-392 | Sources/Siliconed/GEMM.swift:396-404 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/ElementwiseGPU.swift:421 — Sources/Siliconed/ElementwiseGPU.swift:421-427 | Sources/Siliconed/ElementwiseGPU.swift:473-480 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/GEMM.swift:375 — Sources/Siliconed/GEMM.swift:375-381 | Sources/Siliconed/GEMM.swift:408-416 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/Detail.swift:176 — Sources/Siliconed/Detail.swift:176-182 | Sources/Siliconed/Sampler.swift:244-250 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Measurement/Probes.swift:107 — Sources/Measurement/Probes.swift:107-113 | Sources/Siliconed/DiagnosticMachine.swift:136-142 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/Widen.swift:25 — Sources/Siliconed/Widen.swift:25-31 | Sources/Siliconed/Widen.swift:54-60 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/Ops.swift:34 — Sources/Siliconed/Ops.swift:34-42 | Sources/Siliconed/Ops.swift:401-407 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/ProductLedger.swift:156 — Sources/Siliconed/ProductLedger.swift:156-163 | Sources/Siliconed/ProductLedger.swift:166-172 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/SiliconedApp/AppState+Mirror.swift:518 — Sources/SiliconedApp/AppState+Mirror.swift:518-524 | Sources/SiliconedApp/AppState+Mirror.swift:526-532 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/AnimaEngine.swift:17 — Sources/Siliconed/AnimaEngine.swift:17-23 | Sources/Siliconed/Krea2Engine.swift:62-68 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/RenderCache.swift:124 — Sources/Siliconed/RenderCache.swift:124-132 | Sources/Siliconed/RenderCache.swift:135-141 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/Remote/Host.swift:250 — Sources/Siliconed/Remote/Host.swift:250-257 | Sources/Siliconed/Remote/Host.swift:259-265 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/Siliconed/CapacityClasses.swift:308 — Sources/Siliconed/CapacityClasses.swift:308-314 | Sources/Siliconed/CapacityClasses.swift:317-324 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/SiliconedApp/MirrorServer.swift:646 — Sources/SiliconedApp/MirrorServer.swift:646-652 | Sources/SiliconedApp/MirrorLibrary.swift:287-293 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) Sources/SiliconedApp/MirrorLibrary.swift:270 — Sources/SiliconedApp/MirrorLibrary.swift:270-276 | Sources/SiliconedApp/MirrorServer.swift:586-592 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×13
  • Duplicated block (8 lines × 2) Sources/Siliconed/DiagnosticJudgement.swift:64 — Sources/Siliconed/DiagnosticJudgement.swift:64-71 | Sources/Verification/Measures.swift:27-34 — 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 `Sources/Siliconed/DiagnosticJudgement.swift:64` 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (8 lines × 2) Sources/Siliconed/Krea2.swift:912 — Sources/Siliconed/Krea2.swift:912-919 | Sources/Siliconed/Krea2.swift:930-937 — 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 `Sources/Siliconed/Krea2.swift:912` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/SiliconedApp/LabView.swift:359 — Sources/SiliconedApp/LabView.swift:359-366 | Sources/SiliconedApp/PromptField.swift:73-80 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) Sources/SiliconedApp/RemoteControl+Commands.swift:417 — Sources/SiliconedApp/RemoteControl+Commands.swift:417-424 | Sources/SiliconedApp/RemoteControl+Mirror.swift:395-402 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) Sources/SiliconedApp/RemoteControl+Follow.swift:20 — Sources/SiliconedApp/RemoteControl+Follow.swift:20-27 | Sources/SiliconedApp/RemoteControl+Follow.swift:137-145 — 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 `Sources/SiliconedApp/RemoteControl+Follow.swift:20` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (8 lines × 2) Sources/SiliconedApp/RemoteControl+Lab.swift:83 — Sources/SiliconedApp/RemoteControl+Lab.swift:83-90 | Sources/SiliconedApp/RemoteControl+Writer.swift:23-30 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) Sources/Siliconed/Ops.swift:85 — Sources/Siliconed/Ops.swift:85-92 | Sources/Siliconed/Ops.swift:245-252 — 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 `Sources/Siliconed/Ops.swift:85` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) Sources/Siliconed/ModulesKrea2.swift:66 — Sources/Siliconed/ModulesKrea2.swift:66-73 | Sources/Siliconed/ModulesQwenImage21.swift:84-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:247 — Sources/SiliconedApp/RemoteControl+Add.swift:247-254 | Sources/SiliconedApp/RemoteControl+Mirror.swift:149-156 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) tools/oracle/anima.py:460 — tools/oracle/anima.py:460-467 | tools/oracle/krea2.py:419-426 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) tools/oracle/anima.py:404 — tools/oracle/anima.py:404-411 | tools/oracle/anima.py:445-452 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) tools/oracle/krea2.py:349 — tools/oracle/krea2.py:349-356 | tools/oracle/krea2.py:379-386 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `tools/oracle/krea2.py:349` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) tools/oracle/krea2.py:407 — tools/oracle/krea2.py:407-414 | tools/oracle/krea2.py:487-494 — 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 · Edited copy of a member (3 corresponding lines) · ×12
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/DiagnosticProbes.swift:82 — Sources/Siliconed/DiagnosticProbes.swift:82-84 | Sources/Siliconed/DiagnosticProbes.swift:89-94 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Flux2VAE.swift:211 — Sources/Siliconed/Flux2VAE.swift:211-214 | Sources/Siliconed/VAEEncoder.swift:387-389 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Prefetcher.swift:492 — Sources/Siliconed/Prefetcher.swift:492-494 | Sources/Siliconed/Prefetcher.swift:495-500 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Qwen35.swift:367 — Sources/Siliconed/Qwen35.swift:367-369 | Sources/Siliconed/TextEncoder.swift:341-343 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Qwen35.swift:371 — Sources/Siliconed/Qwen35.swift:371-373 | Sources/Siliconed/TextEncoder.swift:352-354 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/DiT.swift:473 — Sources/Siliconed/DiT.swift:473-476 | Sources/Siliconed/MemoryNeedKrea2.swift:363-365 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/MossImage.swift:867 — Sources/Siliconed/MossImage.swift:867-869 | Sources/Siliconed/QwenImage21.swift:891-893 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Qwen35.swift:194 — Sources/Siliconed/Qwen35.swift:194-196 | Sources/Siliconed/TextEncoder.swift:218-220 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Block.swift:27 — Sources/Siliconed/Block.swift:27-29 | Sources/Siliconed/Crop.swift:29-31 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Anima.swift:967 — Sources/Siliconed/Anima.swift:967-969 | Sources/Siliconed/DiT.swift:420-422 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) Sources/Siliconed/Qwen3VLGeneration.swift:245 — Sources/Siliconed/Qwen3VLGeneration.swift:245-247 | Sources/Siliconed/QwenImage21.swift:202-204 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (3 corresponding lines) tools/oracle/qwen-image-2.1-writer.py:87 — tools/oracle/qwen-image-2.1-writer.py:87-89 | tools/oracle/qwen-image-2.1.py:173-177 — These two members are one piece of code written twice and then edited apart: 3 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.
D3 · God Classes · FileTooLong · ×11
  • FileTooLong: SilicontrolHelp/RemoteControlHelp.swift Sources/SilicontrolHelp/RemoteControlHelp.swift — FileTooLong — 2331 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1831 over it, 4.66× 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: Siliconed/QwenImage21.swift Sources/Siliconed/QwenImage21.swift — FileTooLong — 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41× 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: Siliconed/Krea2.swift Sources/Siliconed/Krea2.swift — FileTooLong — 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 over it, 1.35× 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: Siliconed/WeightProducts.swift Sources/Siliconed/WeightProducts.swift — FileTooLong — 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Siliconed/Artifact.swift Sources/Siliconed/Artifact.swift — FileTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 over it, 1.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Siliconed/Anima.swift Sources/Siliconed/Anima.swift — FileTooLong — 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Siliconed/MossImage.swift Sources/Siliconed/MossImage.swift — FileTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: SiliconedApp/AppState+Render.swift Sources/SiliconedApp/AppState+Render.swift — FileTooLong — 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Siliconed/QwenImage21VAE.swift Sources/Siliconed/QwenImage21VAE.swift — FileTooLong — 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Forge/Installation.swift Sources/Siliconed/Forge/Installation.swift — FileTooLong — 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02× 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: SiliconedApp/App.swift Sources/SiliconedApp/App.swift — FileTooLong — 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×11
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/ModulesKrea2.swift:65 — Sources/Siliconed/ModulesKrea2.swift:65-73 | Sources/Siliconed/ModulesQwenImage21.swift:83-91 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/SiliconedApp/Rack.swift:121 — Sources/SiliconedApp/Rack.swift:121-131 | Sources/SiliconedApp/Rack.swift:135-143 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/CapacityFit.swift:755 — Sources/Siliconed/CapacityFit.swift:755-764 | Sources/Siliconed/CapacityProbesConvolution.swift:126-134 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/Modules.swift:287 — Sources/Siliconed/Modules.swift:287-295 | Sources/Siliconed/Modules.swift:323-331 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/CapacityClasses.swift:498 — Sources/Siliconed/CapacityClasses.swift:498-507 | Sources/Siliconed/CapacityClasses.swift:512-520 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Verification/ResidualPermutation.swift:67 — Sources/Verification/ResidualPermutation.swift:67-75 | Sources/Verification/ResidualPermutation.swift:79-87 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/SiliconedApp/Curtain.swift:318 — Sources/SiliconedApp/Curtain.swift:318-326 | Sources/SiliconedApp/SceneView.swift:290-298 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/ElementwiseGPUqwen.swift:167 — Sources/Siliconed/ElementwiseGPUqwen.swift:167-175 | Sources/Siliconed/QKNormRope.swift:156-164 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/SiliconedApp/Curtain.swift:330 — Sources/SiliconedApp/Curtain.swift:330-339 | Sources/SiliconedApp/SceneView.swift:82-90 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) Sources/Siliconed/Remote/Installing.swift:250 — Sources/Siliconed/Remote/Installing.swift:250-259 | Sources/SiliconedApp/MirrorLibrary.swift:177-185 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) tools/oracle/krea2.py:106 — tools/oracle/krea2.py:106-114 | tools/oracle/qwen-image-2.1.py:139-147 — These two members are one piece of code written twice and then edited apart: 9 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 (5 corresponding lines) · ×11
  • Edited copy of a member (5 corresponding lines) Sources/SiliconedApp/CropEditor.swift:266 — Sources/SiliconedApp/CropEditor.swift:266-270 | Sources/SiliconedApp/SubjectSheet.swift:325-329 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/QwenImage21VAE.swift:267 — Sources/Siliconed/QwenImage21VAE.swift:267-272 | Sources/Siliconed/QwenImage21VAE.swift:275-279 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/Forge/ForgeQwen35.swift:109 — Sources/Siliconed/Forge/ForgeQwen35.swift:109-113 | Sources/Siliconed/Forge/ForgeText.swift:64-68 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/MemoryNeedPromptWriter.swift:243 — Sources/Siliconed/MemoryNeedPromptWriter.swift:243-250 | Sources/Siliconed/MemoryNeedPromptWriter.swift:253-257 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/MemoryNeedKrea2.swift:316 — Sources/Siliconed/MemoryNeedKrea2.swift:316-320 | Sources/Siliconed/MemoryNeedMossImage.swift:63-67 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/SiliconedApp/AppState+References.swift:26 — Sources/SiliconedApp/AppState+References.swift:26-31 | Sources/SiliconedApp/AppState+Start.swift:108-112 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/CapacityPlan.swift:670 — Sources/Siliconed/CapacityPlan.swift:670-675 | Sources/Siliconed/MemoryNeed.swift:537-541 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Siliconed/EngineRender.swift:24 — Sources/Siliconed/EngineRender.swift:24-31 | Sources/Siliconed/EngineRender.swift:34-38 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/Measurement/Series.swift:153 — Sources/Measurement/Series.swift:153-157 | Sources/Siliconed/CapacityFit.swift:47-51 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/SiliconedApp/RemoteControlSocket.swift:226 — Sources/SiliconedApp/RemoteControlSocket.swift:226-230 | Sources/Silicontrol/main.swift:37-42 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) Sources/SiliconedApp/AppModels.swift:495 — Sources/SiliconedApp/AppModels.swift:495-499 | Sources/SiliconedApp/RackMiniChain.swift:80-84 — These two members are one piece of code written twice and then edited apart: 5 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 (7 lines × 2) · ×11
  • Duplicated block (7 lines × 2) Sources/Siliconed/QwenImage21Sampler.swift:163 — Sources/Siliconed/QwenImage21Sampler.swift:163-169 | Sources/Siliconed/Sampler.swift:178-184 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/QwenImage21Sampler.swift:163` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) Sources/SiliconedApp/AppState+References.swift:18 — Sources/SiliconedApp/AppState+References.swift:18-24 | Sources/SiliconedApp/AppState+Start.swift:116-122 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (7 lines × 2) Sources/Siliconed/Arena.swift:199 — Sources/Siliconed/Arena.swift:199-205 | Sources/Siliconed/VAEMemory.swift:571-577 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) Sources/Siliconed/MossImage.swift:836 — Sources/Siliconed/MossImage.swift:836-842 | Sources/Siliconed/Ops.swift:131-137 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) Sources/SiliconedApp/AppState+Hub.swift:39 — Sources/SiliconedApp/AppState+Hub.swift:39-45 | Sources/SiliconedApp/MirrorLibrary.swift:140-146 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SiliconedApp/AppState+Hub.swift:39` 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) Sources/Siliconed/Anima.swift:819 — Sources/Siliconed/Anima.swift:819-825 | Sources/Siliconed/Krea2.swift:697-703 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) Sources/Siliconed/ElementwiseGPUMoss.swift:167 — Sources/Siliconed/ElementwiseGPUMoss.swift:167-173 | Sources/Siliconed/ElementwiseGPUkrea2.swift:173-179 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/Siliconed/ElementwiseGPUkrea2.swift:181` calls `NormParams`, `UInt32` and `Sources/Siliconed/ElementwiseGPUMoss.swift:175` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:431 — Sources/SiliconedApp/RemoteControl+Add.swift:431-437 | Sources/SiliconedApp/RemoteControl+Mirror.swift:296-302 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SiliconedApp/RemoteControl+Add.swift:431` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) tools/oracle/anima.py:652 — tools/oracle/anima.py:652-658 | tools/oracle/krea2.py:1011-1017 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `tools/oracle/anima.py:652` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `tools/oracle/anima.py:660` calls `error` and `tools/oracle/krea2.py:1018` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) tools/oracle/quant_fixtures.py:1091 — tools/oracle/quant_fixtures.py:1091-1097 | tools/oracle/quant_fixtures.py:1310-1316 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) tools/oracle/z-image.py:277 — tools/oracle/z-image.py:277-283 | tools/oracle/z-image.py:300-306 — 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 (6 lines × 2) · ×11
  • Duplicated block (6 lines × 2) Sources/Siliconed/Attention.swift:228 — Sources/Siliconed/Attention.swift:228-233 | Sources/Siliconed/HeadSplitAttention.swift:292-297 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Attention.swift:228` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Sources/Siliconed/Flux2VAE.swift:109 — Sources/Siliconed/Flux2VAE.swift:109-114 | Sources/Siliconed/Flux2VAE.swift:133-138 — 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 `Sources/Siliconed/Flux2VAE.swift:109` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) Sources/Siliconed/Anima.swift:471 — Sources/Siliconed/Anima.swift:471-476 | Sources/Siliconed/Anima.swift:500-505 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) Sources/Siliconed/Detail.swift:177 — Sources/Siliconed/Detail.swift:177-182 | Sources/Siliconed/Sampler.swift:245-250 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (6 lines × 2) Sources/Siliconed/Qwen35.swift:468 — Sources/Siliconed/Qwen35.swift:468-473 | Sources/Siliconed/TextEncoder.swift:404-409 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) Sources/SiliconedApp/RemoteControl+Commands.swift:451 — Sources/SiliconedApp/RemoteControl+Commands.swift:451-456 | Sources/SiliconedApp/RemoteControl+Mirror.swift:435-440 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) Sources/SiliconedApp/PromptField.swift:553 — Sources/SiliconedApp/PromptField.swift:553-558 | Sources/SiliconedApp/PromptField.swift:577-582 — 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 `Sources/SiliconedApp/PromptField.swift:553` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) Sources/SiliconedApp/Rack.swift:126 — Sources/SiliconedApp/Rack.swift:126-131 | Sources/SiliconedApp/Rack.swift:138-143 — 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 `Sources/SiliconedApp/Rack.swift:126` 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (6 lines × 2) tools/oracle/anima.py:297 — tools/oracle/anima.py:297-302 | tools/oracle/anima.py:535-540 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) tools/oracle/anima.py:619 — tools/oracle/anima.py:619-624 | tools/oracle/krea2.py:964-969 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) tools/oracle/moss-image.py:687 — tools/oracle/moss-image.py:687-692 | tools/oracle/moss-image.py:746-751 — 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.
D10 · Test Quality · Skipped test · ×10
  • Skipped test: testFasterRenderingIsTheRequestsAndReachesThePlan Tests/SiliconedTests/AdmissionTests.swift:46 — Skipped — throws XCTSkip
  • Skipped test: testTheHalfSizeRuleAlone Tests/SiliconedTests/AdmissionTests.swift:63 — Skipped — throws XCTSkip
  • Skipped test: testAnimaOffByDefaultThreeWhenOnNeverUnderTheRules Tests/SiliconedTests/HalfSizeStartTests.swift:29 — Skipped — throws XCTSkip
  • Skipped test: testTheHalfSizeStartFollowsTheOthersRules Tests/SiliconedTests/MossImageFamilyTests.swift:148 — Skipped — throws XCTSkip
  • Skipped test: testInt8RouteAgainstFloat64 Tests/SiliconedTests/NeuralEngineTests.swift:194 — Skipped — throws XCTSkip
  • Skipped test: testInt8RouteGivesBackANonFiniteActivation Tests/SiliconedTests/NeuralEngineTests.swift:241 — Skipped — throws XCTSkip
  • Skipped test: testNoFamilyPlanReadsTheSettings Tests/SiliconedTests/PlanReadsNoSettingsTests.swift:10 — Skipped — throws XCTSkip
  • Skipped test: testTheTripwireCountsAReadInsideItsScope Tests/SiliconedTests/PlanReadsNoSettingsTests.swift:35 — Skipped — throws XCTSkip
  • Skipped test: testQwenSpectralPlan Tests/SiliconedTests/PureFunctionsTests.swift:107 — Skipped — throws XCTSkip
  • Skipped test: testKrea2SpectralPlan Tests/SiliconedTests/PureFunctionsTests.swift:133 — Skipped — throws XCTSkip
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×10
  • Edited copy of a member (4 corresponding lines) Sources/SiliconedApp/Curtain.swift:342 — Sources/SiliconedApp/Curtain.swift:342-345 | Sources/SiliconedApp/SceneView.swift:93-97 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/QwenImage21VAE.swift:156 — Sources/Siliconed/QwenImage21VAE.swift:156-159 | Sources/Siliconed/QwenImage21VAE.swift:162-166 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/Safetensors.swift:235 — Sources/Siliconed/Safetensors.swift:235-239 | Sources/Siliconed/Safetensors.swift:243-246 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/Krea2.swift:641 — Sources/Siliconed/Krea2.swift:641-644 | Sources/Siliconed/MossImage.swift:660-663 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/QwenImage21.swift:427 — Sources/Siliconed/QwenImage21.swift:427-430 | Sources/Siliconed/QwenImage21.swift:434-438 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/Remote/Pairings.swift:48 — Sources/Siliconed/Remote/Pairings.swift:48-51 | Sources/Siliconed/Remote/Pairings.swift:54-57 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/SiliconedApp/AppModels.swift:216 — Sources/SiliconedApp/AppModels.swift:216-219 | Sources/SiliconedApp/Subjects.swift:210-213 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) Sources/Siliconed/Arena.swift:174 — Sources/Siliconed/Arena.swift:174-177 | Sources/Siliconed/Safetensors.swift:162-165 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) tools/oracle/qwen-image-2.1-writer.py:80 — tools/oracle/qwen-image-2.1-writer.py:80-83 | tools/oracle/qwen-image-2.1.py:166-169 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) tools/oracle/anima.py:287 — tools/oracle/anima.py:287-290 | tools/oracle/moss-image.py:446-449 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D3 · God Classes · TooManyMethods · ×8
  • TooManyMethods: AppState Sources/SiliconedApp/AppState.swift:42 — TooManyMethods — 270 methods, declared across 23 files: SiliconedApp/AppState.swift (32), SiliconedApp/AppState+Render.swift (30), SiliconedApp/AppState+History.swift (27), SiliconedApp/AppState+Catalog.swift (20), +19 more file(s). The bar is 30 methods; this is 240 over it, 9.00× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: RemoteControl Sources/SiliconedApp/RemoteControl.swift:30 — TooManyMethods — 97 methods, declared across 9 files: SiliconedApp/RemoteControl+Gestures.swift (21), SiliconedApp/RemoteControl+Commands.swift (18), SiliconedApp/RemoteControl.swift (16), SiliconedApp/RemoteControl+Writer.swift (10), +5 more file(s). The bar is 30 methods; this is 67 over it, 3.23× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: Library Sources/Siliconed/Library.swift:24 — TooManyMethods — 52 methods, declared across 8 files: Forge/Management.swift (23), Siliconed/LibraryPlace.swift (9), Siliconed/Library.swift (7), Siliconed/Catalog.swift (6), +4 more file(s). The bar is 30 methods; this is 22 over it, 1.73× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: Artifact Sources/Siliconed/Artifact.swift:14 — TooManyMethods — 50 methods, declared across 5 files: Siliconed/Artifact.swift (34), Siliconed/ArtifactStaging.swift (13), Siliconed/CapacityStream.swift (1), Siliconed/MemoryPlanSites.swift (1), +1 more file(s). The bar is 30 methods; this is 20 over it, 1.67× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: LabModel Sources/SiliconedApp/Lab.swift:37 — TooManyMethods — 47 methods, declared across 2 files: SiliconedApp/Lab.swift (45), SiliconedApp/LabRemote.swift (2). The bar is 30 methods; this is 17 over it, 1.57× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: QwenImage21DiT Sources/Siliconed/QwenImage21.swift:60 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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: MirrorServer Sources/SiliconedApp/MirrorServer.swift:26 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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: ProductSolver Sources/Siliconed/CapacitySolver.swift:289 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×8
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/Krea2.swift:866 — Sources/Siliconed/Krea2.swift:866-871 | Sources/Siliconed/MossImage.swift:707-712 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/SiliconedApp/Palette.swift:92 — Sources/SiliconedApp/Palette.swift:92-99 | Sources/SiliconedApp/Subjects.swift:277-282 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/Widen.swift:726 — Sources/Siliconed/Widen.swift:726-731 | Sources/Siliconed/Widen.swift:734-740 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/Conductor.swift:232 — Sources/Siliconed/Conductor.swift:232-237 | Sources/Siliconed/Conductor.swift:259-264 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/NeuralEngine.swift:269 — Sources/Siliconed/NeuralEngine.swift:269-274 | Sources/Siliconed/NeuralEngine.swift:277-282 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/Qwen3VLGeneration.swift:609 — Sources/Siliconed/Qwen3VLGeneration.swift:609-614 | Sources/Siliconed/Qwen3VLImages.swift:122-127 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/QwenImage21VAE.swift:498 — Sources/Siliconed/QwenImage21VAE.swift:498-503 | Sources/Siliconed/VAE.swift:191-196 — 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.
  • Edited copy of a member (6 corresponding lines) Sources/Siliconed/Widen.swift:710 — Sources/Siliconed/Widen.swift:710-715 | Sources/Siliconed/Widen.swift:718-723 — 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.
D35 · Change Coupling · Change coupling · ×7
  • Change coupling: AppState+Diagnostic.swift ↔ DiagnosticSheet.swift Sources/SiliconedApp/AppState+Diagnostic.swift:1 — `Sources/SiliconedApp/AppState+Diagnostic.swift` and `Sources/SiliconedApp/DiagnosticSheet.swift` change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `e34cb1b5` The first render measures this Mac again when no current map is kept; `67a82949` Measure This Mac starts only on the user's click, after asking for a …; `ef079542` The map's tier follows the memory alone, and its precision gates close — run `git show` on any of them.
  • Change coupling: MemoryNeedKrea2.swift ↔ MemoryNeedQwenImage21.swift Sources/Siliconed/MemoryNeedKrea2.swift:1 — `Sources/Siliconed/MemoryNeedKrea2.swift` and `Sources/Siliconed/MemoryNeedQwenImage21.swift` change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `81e445b6` The decoding carries the denoiser's Neural Engine surfaces instead of…; `db1b9b02` The text encoder kept, a choice of the memory plan charged in B; `3ced8c0b` LoRA products through the capacity plan (work in progress) — run `git show` on any of them.
  • Change coupling: MemoryNeedAnima.swift ↔ MemoryNeedQwenImage21.swift Sources/Siliconed/MemoryNeedAnima.swift:1 — `Sources/Siliconed/MemoryNeedAnima.swift` and `Sources/Siliconed/MemoryNeedQwenImage21.swift` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `81e445b6` The decoding carries the denoiser's Neural Engine surfaces instead of…; `db1b9b02` The text encoder kept, a choice of the memory plan charged in B; `3ced8c0b` LoRA products through the capacity plan (work in progress) — run `git show` on any of them.
  • Change coupling: AppState+Catalog.swift ↔ Rack.swift Sources/SiliconedApp/AppState+Catalog.swift:1 — `Sources/SiliconedApp/AppState+Catalog.swift` and `Sources/SiliconedApp/Rack.swift` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `e34cb1b5` The first render measures this Mac again when no current map is kept; `bd28427f` Series seen at a glance: a yellow ± at the left of what can vary; `67a82949` Measure This Mac starts only on the user's click, after asking for a … — run `git show` on any of them.
  • Change coupling: Errors.swift ↔ AppState.swift Sources/Siliconed/Errors.swift:1 — `Sources/Siliconed/Errors.swift` and `Sources/SiliconedApp/AppState.swift` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder — so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `59b8b6db` No machine profile left in the app; `a94c0538` Library on another disk: move, open or bring it back from Settings; r…; `5fe66a5c` Never deliver an image that is not finite — run `git show` on any of them.
  • Change coupling: Conductor.swift ↔ NeuralEngine.swift Sources/Siliconed/Conductor.swift:1 — `Sources/Siliconed/Conductor.swift` and `Sources/Siliconed/NeuralEngine.swift` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `3ced8c0b` LoRA products through the capacity plan (work in progress); `277ebad8` Capacity map: a route table read by the engine at each product and at…; `b3973f7b` GPU, AMX and Neural Engine together on one product, where the capacit… — run `git show` on any of them.
  • Change coupling: Conductor.swift ↔ Diagnostic.swift Sources/Siliconed/Conductor.swift:1 — `Sources/Siliconed/Conductor.swift` and `Sources/Siliconed/Diagnostic.swift` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `b3973f7b` GPU, AMX and Neural Engine together on one product, where the capacit…; `8c5f572d` Neural Engine beside the AMX, shape by shape; smaller program parts; `93d974e1` Neural Engine share per shape: the capacity map measures the ANE on t… — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×7
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/DiagnosticProbes.swift:133 — Sources/Siliconed/DiagnosticProbes.swift:133-178 | Sources/Siliconed/TensorGEMMInt8.swift:198-221 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/Krea2.swift:374 — Sources/Siliconed/Krea2.swift:374-383 | Sources/Siliconed/MossImage.swift:374-386 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/MemoryNeedKrea2.swift:331 — Sources/Siliconed/MemoryNeedKrea2.swift:331-340 | Sources/Siliconed/MemoryNeedMossImage.swift:79-88 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/NeuralEngine.swift:612 — Sources/Siliconed/NeuralEngine.swift:612-621 | Sources/Siliconed/NeuralEngine.swift:624-633 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/CapacityModel.swift:146 — Sources/Siliconed/CapacityModel.swift:146-155 | Sources/Siliconed/CapacityModel.swift:216-226 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/Siliconed/Ops.swift:82 — Sources/Siliconed/Ops.swift:82-94 | Sources/Siliconed/Ops.swift:244-253 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) Sources/SiliconedApp/AppState+Place.swift:119 — Sources/SiliconedApp/AppState+Place.swift:119-129 | Sources/SiliconedApp/AppState+Place.swift:157-166 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×7
  • Duplicated block (9 lines × 2) Sources/Siliconed/Anima.swift:910 — Sources/Siliconed/Anima.swift:910-918 | Sources/Siliconed/Ops.swift:228-236 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Anima.swift:910` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/Siliconed/Krea2.swift:982 — Sources/Siliconed/Krea2.swift:982-990 | Sources/Siliconed/Qwen3VLGeneration.swift:532-540 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9 lines × 2) Sources/Siliconed/Ops.swift:259 — Sources/Siliconed/Ops.swift:259-267 | Sources/Siliconed/Ops.swift:295-303 — 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 `Sources/Siliconed/Ops.swift:259` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (9 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:14 — Sources/SiliconedApp/RemoteControl+Add.swift:14-22 | Sources/SiliconedApp/RemoteControl+Commands.swift:177-185 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SiliconedApp/RemoteControl+Add.swift:14` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/Siliconed/Krea2.swift:660 — Sources/Siliconed/Krea2.swift:660-668 | Sources/Siliconed/MossImage.swift:678-686 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Krea2.swift:660` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) Sources/Siliconed/AnimaGELU.swift:95 — Sources/Siliconed/AnimaGELU.swift:95-103 | Sources/Siliconed/MossImage.swift:927-935 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/AnimaGELU.swift:95` 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.
  • Duplicated block (9 lines × 2) tools/oracle/qwen-image-2.1-writer.py:217 — tools/oracle/qwen-image-2.1-writer.py:217-225 | tools/oracle/qwen-image-2.1.py:216-226 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×5
  • Edited copy of a member (13 corresponding lines) Sources/Siliconed/MemoryNeedQwenImage21.swift:247 — Sources/Siliconed/MemoryNeedQwenImage21.swift:247-260 | Sources/Siliconed/MemoryNeedQwenImage21.swift:263-275 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Sources/Siliconed/Widen.swift:755 — Sources/Siliconed/Widen.swift:755-767 | Sources/Siliconed/Widen.swift:770-783 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Sources/Siliconed/Conductor.swift:198 — Sources/Siliconed/Conductor.swift:198-210 | Sources/Siliconed/Conductor.swift:216-228 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Sources/SiliconedApp/Lab.swift:589 — Sources/SiliconedApp/Lab.swift:589-601 | Sources/SiliconedApp/SubjectSheet.swift:171-183 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) Sources/Siliconed/PhaseBoundary.swift:160 — Sources/Siliconed/PhaseBoundary.swift:160-173 | Sources/Siliconed/DiagnosticJudgement.swift:112-124 — These two members are one piece of code written twice and then edited apart: 13 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×5
  • Swallowed exception (caught, then discarded) Sources/Siliconed/Catalog.swift:284 — `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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) Sources/Siliconed/DiagnosticMachine.swift:199 — `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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) Sources/Siliconed/DiagnosticWideningProbes.swift:38 — `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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) Sources/Siliconed/NeuralEngine.swift:427 — `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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) Sources/Siliconed/NeuralEngine.swift:692 — `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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×4
  • Edited copy of a member (8 corresponding lines) Sources/Siliconed/TensorGEMMBF16.swift:144 — Sources/Siliconed/TensorGEMMBF16.swift:144-154 | Sources/Siliconed/TensorGEMMKQuant.swift:145-153 — 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.
  • Edited copy of a member (8 corresponding lines) Sources/Verification/ResidualPermutation.swift:301 — Sources/Verification/ResidualPermutation.swift:301-308 | Sources/Verification/ResidualPermutation.swift:310-317 — 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.
  • Edited copy of a member (8 corresponding lines) Sources/SiliconedApp/AppState+References.swift:17 — Sources/SiliconedApp/AppState+References.swift:17-24 | Sources/SiliconedApp/AppState+Start.swift:115-122 — 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.
  • Edited copy of a member (8 corresponding lines) Sources/Siliconed/Qwen3VLImages.swift:332 — Sources/Siliconed/Qwen3VLImages.swift:332-339 | Sources/Siliconed/Qwen3VLImages.swift:341-349 — 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 (21 corresponding lines) · ×4
  • Edited copy of a member (21 corresponding lines) Sources/Siliconed/WeightProducts.swift:671 — Sources/Siliconed/WeightProducts.swift:671-693 | Sources/Siliconed/WeightProducts.swift:717-737 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) tools/oracle/z-image.py:266 — tools/oracle/z-image.py:266-286 | tools/oracle/z-image.py:290-310 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) tools/oracle/krea2.py:130 — tools/oracle/krea2.py:130-152 | tools/oracle/moss-image.py:213-233 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) tools/oracle/z-image.py:518 — tools/oracle/z-image.py:518-540 | tools/oracle/z-image.py:544-564 — These two members are one piece of code written twice and then edited apart: 21 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 (15 corresponding lines) · ×4
  • Edited copy of a member (15 corresponding lines) Sources/Siliconed/ElementwiseGPU.swift:365 — Sources/Siliconed/ElementwiseGPU.swift:365-382 | Sources/Siliconed/ElementwiseGPU.swift:404-418 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) Sources/Siliconed/Tokenizer.swift:222 — Sources/Siliconed/Tokenizer.swift:222-241 | Sources/Siliconed/Tokenizer.swift:526-540 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) Sources/Siliconed/Ops.swift:16 — Sources/Siliconed/Ops.swift:16-31 | Sources/Siliconed/Qwen35.swift:339-353 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) tools/oracle/anima.py:460 — tools/oracle/anima.py:460-474 | tools/oracle/krea2.py:419-435 — These two members are one piece of code written twice and then edited apart: 15 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, 4+ corresponding lines) · ×4
  • Edited copies of one member (3 members, 4+ corresponding lines) Sources/Siliconed/Block.swift:161 — Sources/Siliconed/Block.swift:161-166 | Sources/Siliconed/Ops.swift:448-451 | Sources/Siliconed/Qwen3VLGeneration.swift:458-461 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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.
  • Edited copies of one member (3 members, 4+ corresponding lines) Sources/Siliconed/Krea2.swift:119 — Sources/Siliconed/Krea2.swift:119-122 | Sources/Siliconed/MossImage.swift:121-124 | Sources/Siliconed/QwenImage21.swift:1012-1015 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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.
  • Edited copies of one member (3 members, 4+ corresponding lines) Sources/Siliconed/Anima.swift:1022 — Sources/Siliconed/Anima.swift:1022-1028 | Sources/Siliconed/MemoryNeedKrea2.swift:297-300 | Sources/Siliconed/MemoryNeedMossImage.swift:47-50 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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.
  • Edited copies of one member (3 members, 4+ corresponding lines) Sources/SiliconedApp/AppModels.swift:216 — Sources/SiliconedApp/AppModels.swift:216-219 | Sources/SiliconedApp/AppState+Mirror.swift:478-481 | Sources/SiliconedApp/Subjects.swift:210-213 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×4
  • Low cohesion: DecodeKernels (LCOM4 8) Sources/Siliconed/DecodeKernels.swift:38 — DecodeKernels's methods fall into 8 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 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: View (LCOM4 8) Sources/SiliconedApp/LabView.swift:341 — View's methods fall into 8 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 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Coordinator (LCOM4 4) Sources/SiliconedApp/PromptField.swift:149 — Coordinator's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: PromptTextView (LCOM4 4) Sources/SiliconedApp/PromptField.swift:356 — PromptTextView'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.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×3
  • Edited copy of a member (17 corresponding lines) Sources/Siliconed/Flux2VAE.swift:105 — Sources/Siliconed/Flux2VAE.swift:105-121 | Sources/Siliconed/Flux2VAE.swift:128-145 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) Sources/Siliconed/CapacityPlan.swift:246 — Sources/Siliconed/CapacityPlan.swift:246-262 | Sources/Siliconed/CapacityPlan.swift:267-283 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) tools/oracle/moss-image.py:627 — tools/oracle/moss-image.py:627-643 | tools/oracle/moss-image.py:647-673 — These two members are one piece of code written twice and then edited apart: 17 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 (11 corresponding lines) · ×3
  • Edited copy of a member (11 corresponding lines) Sources/Siliconed/DecodeKernels.swift:526 — Sources/Siliconed/DecodeKernels.swift:526-537 | Sources/Siliconed/DecodeKernels.swift:567-577 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Sources/Siliconed/AnimaVAE.swift:153 — Sources/Siliconed/AnimaVAE.swift:153-163 | Sources/Siliconed/QwenImage21VAE.swift:777-788 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) Sources/Siliconed/QwenImage21VAE.swift:464 — Sources/Siliconed/QwenImage21VAE.swift:464-474 | Sources/Siliconed/QwenImage21VAE.swift:731-743 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) · ×3
  • Edited copies of one member (3 members, 8+ corresponding lines) Sources/Siliconed/Modules.swift:83 — Sources/Siliconed/Modules.swift:83-91 | Sources/Siliconed/ModulesAnima.swift:81-88 | Sources/Siliconed/MossImageModules.swift:73-82 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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.
  • Edited copies of one member (3 members, 8+ corresponding lines) Sources/Siliconed/DecodeKernels.swift:472 — Sources/Siliconed/DecodeKernels.swift:472-482 | Sources/Siliconed/DecodeKernels.swift:485-492 | Sources/Siliconed/DecodeKernels.swift:514-521 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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.
  • Edited copies of one member (3 members, 8+ corresponding lines) Sources/Siliconed/Flux2VAE.swift:149 — Sources/Siliconed/Flux2VAE.swift:149-156 | Sources/Siliconed/QwenImage21VAE.swift:181-189 | Sources/Siliconed/QwenImage21VAE.swift:192-201 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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, 5+ corresponding lines) · ×3
  • Edited copies of one member (3 members, 5+ corresponding lines) Sources/Siliconed/AnimaVAE.swift:147 — Sources/Siliconed/AnimaVAE.swift:147-151 | Sources/Siliconed/QwenImage21VAE.swift:511-519 | Sources/Siliconed/QwenImage21VAE.swift:771-775 — 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.
  • Edited copies of one member (3 members, 5+ corresponding lines) Sources/Siliconed/CapacityModel.swift:101 — Sources/Siliconed/CapacityModel.swift:101-107 | Sources/Siliconed/MatmulTile.swift:54-60 | Sources/Siliconed/TiledAttention.swift:633-637 — 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.
  • Edited copies of one member (3 members, 5+ corresponding lines) Sources/Siliconed/Instrumentation.swift:28 — Sources/Siliconed/Instrumentation.swift:28-33 | Sources/Siliconed/NeuralEngine.swift:115-119 | Sources/Siliconed/WeightProducts.swift:123-128 — 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) · ×3
  • Edited copies of one member (3 members, 3+ corresponding lines) Sources/Siliconed/DiT.swift:528 — Sources/Siliconed/DiT.swift:528-530 | Sources/Siliconed/MemoryNeedKrea2.swift:304-306 | Sources/Siliconed/MemoryNeedMossImage.swift:53-55 — 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.
  • Edited copies of one member (3 members, 3+ corresponding lines) Sources/Siliconed/Modules.swift:168 — Sources/Siliconed/Modules.swift:168-170 | Sources/Siliconed/ModulesAnima.swift:168-170 | Sources/Siliconed/MossImageModules.swift:154-156 — 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.
  • Edited copies of one member (3 members, 3+ corresponding lines) tools/oracle/anima.py:190 — tools/oracle/anima.py:190-193 | tools/oracle/krea2.py:118-120 | tools/oracle/moss-image.py:136-138 — 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 (1 corresponding lines) · ×3
  • Edited copy of a member (1 corresponding lines) Sources/Siliconed/CapacityModel.swift:60 — Sources/Siliconed/CapacityModel.swift:60-60 | Sources/Siliconed/ProductLedger.swift:62-62 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) Sources/Siliconed/CapacityClasses.swift:193 — Sources/Siliconed/CapacityClasses.swift:193-193 | Sources/Siliconed/RemoteGestures.swift:16-16 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (1 corresponding lines) Sources/Siliconed/MossImage.swift:776 — Sources/Siliconed/MossImage.swift:776-778 | Sources/Siliconed/QwenImage21Pipeline.swift:136-136 — These two members are one piece of code written twice and then edited apart: 1 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 (10 lines × 2) · ×3
  • Duplicated block (10 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:126 — Sources/SiliconedApp/RemoteControl+Add.swift:126-135 | Sources/SiliconedApp/RemoteControl+Mirror.swift:85-94 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (10 lines × 2) Sources/Siliconed/Ops.swift:140 — Sources/Siliconed/Ops.swift:140-149 | Sources/Siliconed/Ops.swift:168-177 — 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 `Sources/Siliconed/Ops.swift:140` 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.
  • Duplicated block (10 lines × 2) tools/oracle/anima.py:606 — tools/oracle/anima.py:606-615 | tools/oracle/krea2.py:951-960 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
X3 · Exception handling · Swallowed exception (empty catch) · ×3
  • Swallowed exception (empty catch) Sources/Siliconed/RenderCache.swift:260 — 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) Sources/Siliconed/Forge/HubLink.swift:241 — 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) Sources/Measurement/Runner.swift:66 — 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.
D3 · God Classes · ClassTooLong · ×2
  • ClassTooLong: MirrorServer Sources/SiliconedApp/MirrorServer.swift:26 — ClassTooLong — 492 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 92 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: KernelStages Sources/Verification/KernelStages.swift:12 — ClassTooLong — 416 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 16 over it, 1.04× 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.
D35 · Change Coupling · Change-coupling hub · ×2
  • Change-coupling hub: RemoteControlHelp.swift → RemoteControl+Add.swift, RemoteControl+Commands.swift, SettingsWindow.swift Sources/SilicontrolHelp/RemoteControlHelp.swift — `Sources/SilicontrolHelp/RemoteControlHelp.swift` changes together with 3 other files — `Sources/SiliconedApp/RemoteControl+Add.swift`, `Sources/SiliconedApp/RemoteControl+Commands.swift`, `Sources/SiliconedApp/SettingsWindow.swift` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
  • Change-coupling hub: Block.swift → Anima.swift, Krea2.swift, MossImage.swift Sources/Siliconed/Block.swift — `Sources/Siliconed/Block.swift` changes together with 3 other files — `Sources/Siliconed/Anima.swift`, `Sources/Siliconed/Krea2.swift`, `Sources/Siliconed/MossImage.swift` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D4 · Code Duplication · Edited copy of a member (24 corresponding lines) · ×2
  • Edited copy of a member (24 corresponding lines) Sources/Siliconed/GEMM.swift:448 — Sources/Siliconed/GEMM.swift:448-477 | Sources/Siliconed/GEMM.swift:597-620 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (24 corresponding lines) Sources/Siliconed/ElementwiseGPUMoss.swift:155 — Sources/Siliconed/ElementwiseGPUMoss.swift:155-179 | Sources/Siliconed/ElementwiseGPUkrea2.swift:163-186 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×2
  • Edited copy of a member (25 corresponding lines) Sources/Siliconed/Widen.swift:220 — Sources/Siliconed/Widen.swift:220-244 | Sources/Siliconed/Widen.swift:247-271 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (25 corresponding lines) tools/oracle/anima.py:577 — tools/oracle/anima.py:577-602 | tools/oracle/krea2.py:923-947 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×2
  • Edited copy of a member (20 corresponding lines) Sources/Verification/Judge.swift:60 — Sources/Verification/Judge.swift:60-85 | Sources/Verification/Measures.swift:54-73 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (20 corresponding lines) tools/oracle/krea2.py:342 — tools/oracle/krea2.py:342-361 | tools/oracle/krea2.py:365-392 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) Sources/Siliconed/Anima.swift:903 — Sources/Siliconed/Anima.swift:903-924 | Sources/Siliconed/Ops.swift:225-242 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (18 corresponding lines) tools/oracle/anima.py:395 — tools/oracle/anima.py:395-412 | tools/oracle/krea2.py:396-415 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×2
  • Edited copy of a member (14 corresponding lines) Sources/Siliconed/Conductor.swift:239 — Sources/Siliconed/Conductor.swift:239-252 | Sources/Siliconed/HeadSplitAttention.swift:564-580 — 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.
  • Edited copy of a member (14 corresponding lines) tools/oracle/krea2.py:229 — tools/oracle/krea2.py:229-248 | tools/oracle/moss-image.py:422-435 — 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, 6+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 6+ corresponding lines) Sources/Siliconed/Flux2VAE.swift:218 — Sources/Siliconed/Flux2VAE.swift:218-224 | Sources/Siliconed/VAE.swift:201-207 | Sources/Siliconed/VAEEncoder.swift:394-399 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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.
  • Edited copies of one member (3 members, 6+ corresponding lines) Sources/Siliconed/QwenImage21VAE.swift:172 — Sources/Siliconed/QwenImage21VAE.swift:172-177 | Sources/Verification/QwenImageStages.swift:348-353 | Sources/Verification/QwenImageStages.swift:355-360 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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 · Duplicated block (6–7 lines × 2) · ×2
  • Duplicated block (6–7 lines × 2) Sources/Siliconed/Krea2.swift:151 — Sources/Siliconed/Krea2.swift:151-157 | Sources/Siliconed/MossImage.swift:152-157 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/MossImage.swift:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6–7 lines × 2) Sources/SiliconedApp/RackDiT.swift:131 — Sources/SiliconedApp/RackDiT.swift:131-137 | Sources/SiliconedApp/RackDiT.swift:195-200 — 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 `Sources/SiliconedApp/RackDiT.swift:131` 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) Sources/Siliconed/Krea2.swift:366 — Sources/Siliconed/Krea2.swift:366-371 | Sources/Siliconed/MossImage.swift:366-371 | Sources/Siliconed/QwenImage21.swift:852-857 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
  • Duplicated block (6 lines × 3) tools/oracle/quant_fixtures.py:365 — tools/oracle/quant_fixtures.py:365-370 | tools/oracle/quant_fixtures.py:1116-1121 | tools/oracle/quant_fixtures.py:1335-1340 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×2
  • Duplicated block (12 lines × 2) tools/oracle/qwen-image-2.1-writer.py:198 — tools/oracle/qwen-image-2.1-writer.py:198-209 | tools/oracle/qwen-image-2.1.py:299-310 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `tools/oracle/qwen-image-2.1-writer.py:210` calls `from_pretrained`, `snap` and `tools/oracle/qwen-image-2.1.py:311` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (12 lines × 2) tools/oracle/anima.py:591 — tools/oracle/anima.py:591-602 | tools/oracle/krea2.py:936-947 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D5 · Coupling · Off the main sequence · ×2
  • Off the main sequence: Measurement — Measurement: 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: SilicontrolHelp — SilicontrolHelp: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
D1 · Cyclomatic Complexity · QuantizedLayouts.recognize (cyclomatic 124) · ×1
  • QuantizedLayouts.recognize (cyclomatic 124) Sources/Siliconed/Forge/Quantization.swift:430 — QuantizedLayouts.recognize has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent 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 · GestureOrder.parse (cyclomatic 120) · ×1
  • GestureOrder.parse (cyclomatic 120) Sources/Siliconed/RemoteGestures.swift:232 — GestureOrder.parse has cyclomatic complexity 120 (threshold 15). Of this number, 118 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ForgeLoRA.forging (cyclomatic 88) · ×1
  • ForgeLoRA.forging (cyclomatic 88) Sources/Siliconed/Forge/ForgeLoRA.swift:420 — ForgeLoRA.forging has cyclomatic complexity 88 (threshold 15). Of this number, 72 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 · EngineError.errorDescription (cyclomatic 77) · ×1
  • EngineError.errorDescription (cyclomatic 77) Sources/Siliconed/Errors.swift:276 — EngineError.errorDescription has cyclomatic complexity 77 (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 · Problem.sentence (cyclomatic 77) · ×1
  • Problem.sentence (cyclomatic 77) Sources/SiliconedApp/Problems.swift:56 — Problem.sentence has cyclomatic complexity 77 (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 · CapacityPlan.forcing (cyclomatic 75) · ×1
  • CapacityPlan.forcing (cyclomatic 75) Sources/Siliconed/CapacityPlan.swift:756 — CapacityPlan.forcing has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent 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 · RemoteControl.add (cyclomatic 73) · ×1
  • RemoteControl.add (cyclomatic 73) Sources/SiliconedApp/RemoteControl+Add.swift:121 — RemoteControl.add has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent 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 · ForgeDiT.tensor (cyclomatic 67) · ×1
  • ForgeDiT.tensor (cyclomatic 67) Sources/Siliconed/Forge/ForgeDiT.swift:357 — ForgeDiT.tensor has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent 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 · WeightProducts.linear (cyclomatic 65) · ×1
  • WeightProducts.linear (cyclomatic 65) Sources/Siliconed/WeightProducts.swift:278 — WeightProducts.linear has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EngineError.init (cyclomatic 63) · ×1
  • EngineError.init (cyclomatic 63) Sources/Siliconed/Errors.swift:474 — EngineError.init has cyclomatic complexity 63 (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 · Context.solo (cyclomatic 59) · ×1
  • Context.solo (cyclomatic 59) Sources/Siliconed/CapacityProbesSolos.swift:194 — Context.solo has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent 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 · AppState.receive (cyclomatic 57) · ×1
  • AppState.receive (cyclomatic 57) Sources/SiliconedApp/AppState+Mirror.swift:266 — AppState.receive has cyclomatic complexity 57 (threshold 15). Of this number, 56 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 · Context.attention (cyclomatic 56) · ×1
  • Context.attention (cyclomatic 56) Sources/Siliconed/CapacityProbesSolos.swift:322 — Context.attention has cyclomatic complexity 56 (threshold 15). Of this number, 48 points are the body's own statements and 8 belong to 4 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 · GGUF.parse (cyclomatic 54) · ×1
  • GGUF.parse (cyclomatic 54) Sources/Siliconed/Forge/GGUF.swift:90 — GGUF.parse has cyclomatic complexity 54 (threshold 15). Of this number, 29 points are the body's own statements and 25 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 · RemoteControl.addOnMirror (cyclomatic 54) · ×1
  • RemoteControl.addOnMirror (cyclomatic 54) Sources/SiliconedApp/RemoteControl+Mirror.swift:74 — RemoteControl.addOnMirror has cyclomatic complexity 54 (threshold 15). Of this number, 45 points are the body's own statements and 9 belong to one function item 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 · Installer.install (cyclomatic 51) · ×1
  • Installer.install (cyclomatic 51) Sources/Siliconed/Forge/Installation.swift:536 — Installer.install 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 · RemoteControl.parse (cyclomatic 49) · ×1
  • RemoteControl.parse (cyclomatic 49) Sources/SiliconedApp/RemoteControl+Add.swift:11 — RemoteControl.parse has cyclomatic complexity 49 (threshold 15). Of this number, 48 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 · ProductAssignment.isRunnable (cyclomatic 48) · ×1
  • ProductAssignment.isRunnable (cyclomatic 48) Sources/Siliconed/CapacityPlan.swift:574 — ProductAssignment.isRunnable 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.
D1 · Cyclomatic Complexity · RenderGrid.init (cyclomatic 47) · ×1
  • RenderGrid.init (cyclomatic 47) Sources/Siliconed/RenderGrid.swift:164 — RenderGrid.init has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Recipes.normalize (cyclomatic 45) · ×1
  • Recipes.normalize (cyclomatic 45) Sources/Siliconed/Forge/Families.swift:345 — Recipes.normalize has cyclomatic complexity 45 (threshold 15). Of this number, 44 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 · NeuralEngine.run (cyclomatic 43) · ×1
  • NeuralEngine.run (cyclomatic 43) Sources/Siliconed/NeuralEngine.swift:284 — NeuralEngine.run has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ProductSolver.widened (cyclomatic 42) · ×1
  • ProductSolver.widened (cyclomatic 42) Sources/Siliconed/CapacitySolver.swift:375 — ProductSolver.widened has cyclomatic complexity 42 (threshold 15). Of this number, 32 points are the body's own statements and 10 belong to 2 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 · Artifact.parse (cyclomatic 40) · ×1
  • Artifact.parse (cyclomatic 40) Sources/Siliconed/Artifact.swift:280 — Artifact.parse has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · T5Tokenizer.init (cyclomatic 40) · ×1
  • T5Tokenizer.init (cyclomatic 40) Sources/Siliconed/T5Tokenizer.swift:45 — T5Tokenizer.init 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 · Context.trial (cyclomatic 39) · ×1
  • Context.trial (cyclomatic 39) Sources/Siliconed/CapacityProbesSharing.swift:231 — Context.trial has cyclomatic complexity 39 (threshold 15). Of this number, 24 points are the body's own statements and 15 belong to 2 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 · CapacityFit.model (cyclomatic 39) · ×1
  • CapacityFit.model (cyclomatic 39) Sources/Siliconed/CapacityFit.swift:687 — CapacityFit.model 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 · WeightProducts.prepare (cyclomatic 39) · ×1
  • WeightProducts.prepare (cyclomatic 39) Sources/Siliconed/WeightProducts.swift:874 — WeightProducts.prepare has cyclomatic complexity 39 (threshold 15). Of this number, 38 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 · Krea2PermutedMap.write (cyclomatic 39) · ×1
  • Krea2PermutedMap.write (cyclomatic 39) Sources/Verification/ResidualPermutation.swift:203 — Krea2PermutedMap.write has cyclomatic complexity 39 (threshold 15). Of this number, 36 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 · QwenImage21DiT.body (cyclomatic 38) · ×1
  • QwenImage21DiT.body (cyclomatic 38) Sources/Siliconed/QwenImage21.swift:452 — QwenImage21DiT.body has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Runner.run (cyclomatic 37) · ×1
  • Runner.run (cyclomatic 37) Sources/Measurement/Runner.swift:27 — Runner.run has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body's own statements and 6 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 · Qwen3VLGenerator.generate (cyclomatic 37) · ×1
  • Qwen3VLGenerator.generate (cyclomatic 37) Sources/Siliconed/Qwen3VLGeneration.swift:259 — Qwen3VLGenerator.generate has cyclomatic complexity 37 (threshold 15). Of this number, 33 points are the body's own statements and 4 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 · Engine.execute (cyclomatic 35) · ×1
  • Engine.execute (cyclomatic 35) Sources/Siliconed/EngineRender.swift:52 — Engine.execute has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · RenderGrid.axis (cyclomatic 35) · ×1
  • RenderGrid.axis (cyclomatic 35) Sources/Siliconed/RenderGrid.swift:357 — RenderGrid.axis has cyclomatic complexity 35 (threshold 15). Of this number, 32 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 · ProductSolver.native (cyclomatic 34) · ×1
  • ProductSolver.native (cyclomatic 34) Sources/Siliconed/CapacitySolver.swift:437 — ProductSolver.native has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body's own statements and 7 belong to 2 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 · Tokenizer.init (cyclomatic 34) · ×1
  • Tokenizer.init (cyclomatic 34) Sources/Siliconed/Tokenizer.swift:86 — Tokenizer.init has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ForgeDiT.forge (cyclomatic 34) · ×1
  • ForgeDiT.forge (cyclomatic 34) Sources/Siliconed/Forge/ForgeDiT.swift:197 — ForgeDiT.forge has cyclomatic complexity 34 (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 · Safetensors.init (cyclomatic 33) · ×1
  • Safetensors.init (cyclomatic 33) Sources/Siliconed/Safetensors.swift:58 — Safetensors.init 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 · AppState.execute (cyclomatic 33) · ×1
  • AppState.execute (cyclomatic 33) Sources/SiliconedApp/AppState+Render.swift:359 — AppState.execute 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 · Context.validate (cyclomatic 32) · ×1
  • Context.validate (cyclomatic 32) Sources/Siliconed/CapacityProbesValidation.swift:14 — Context.validate has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body's own statements and 4 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 · ProductSolver.evaluate (cyclomatic 32) · ×1
  • ProductSolver.evaluate (cyclomatic 32) Sources/Siliconed/CapacitySolver.swift:674 — ProductSolver.evaluate has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RemoteControl.handle (cyclomatic 32) · ×1
  • RemoteControl.handle (cyclomatic 32) Sources/SiliconedApp/RemoteControl.swift:78 — RemoteControl.handle has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ForgeText.plan (cyclomatic 31) · ×1
  • ForgeText.plan (cyclomatic 31) Sources/Siliconed/Forge/ForgeText.swift:71 — ForgeText.plan has cyclomatic complexity 31 (threshold 15). Of this number, 18 points are the body's own statements and 13 belong to one function item 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 · Invocation.init (cyclomatic 31) · ×1
  • Invocation.init (cyclomatic 31) Sources/Verification/Invocation.swift:55 — Invocation.init has cyclomatic complexity 31 (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 · QwenImageWriterStages.check (cyclomatic 31) · ×1
  • QwenImageWriterStages.check (cyclomatic 31) Sources/Verification/QwenImageWriterStages.swift:119 — QwenImageWriterStages.check 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 · MirrorServer.handle (cyclomatic 30) · ×1
  • MirrorServer.handle (cyclomatic 30) Sources/SiliconedApp/MirrorServer.swift:172 — MirrorServer.handle has cyclomatic complexity 30 (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 · MossImageStages.evaluate (cyclomatic 30) · ×1
  • MossImageStages.evaluate (cyclomatic 30) Sources/Verification/MossImageStages.swift:149 — MossImageStages.evaluate 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 · ForgeLoRA.targets (cyclomatic 29) · ×1
  • ForgeLoRA.targets (cyclomatic 29) Sources/Siliconed/Forge/ForgeLoRA.swift:325 — ForgeLoRA.targets 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 · Context.trialPair (cyclomatic 28) · ×1
  • Context.trialPair (cyclomatic 28) Sources/Siliconed/CapacityProbesSharing.swift:88 — Context.trialPair has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 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 · TokenizerJSON.string (cyclomatic 28) · ×1
  • TokenizerJSON.string (cyclomatic 28) Sources/Siliconed/TokenizerTables.swift:173 — TokenizerJSON.string has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body's own statements and 7 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 · RemoteControl.subjects (cyclomatic 28) · ×1
  • RemoteControl.subjects (cyclomatic 28) Sources/SiliconedApp/RemoteControl+Commands.swift:156 — RemoteControl.subjects has cyclomatic complexity 28 (threshold 15). Of this number, 27 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 · Config.init (cyclomatic 27) · ×1
  • Config.init (cyclomatic 27) Sources/Siliconed/Qwen35.swift:74 — Config.init has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · QwenImage21Sampler.run (cyclomatic 27) · ×1
  • QwenImage21Sampler.run (cyclomatic 27) Sources/Siliconed/QwenImage21Sampler.swift:83 — QwenImage21Sampler.run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Attention.init (cyclomatic 26) · ×1
  • Attention.init (cyclomatic 26) Sources/Siliconed/Attention.swift:106 — Attention.init has cyclomatic complexity 26 (threshold 15). Of this number, 25 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 · MossImageDiT.blockStreamed (cyclomatic 26) · ×1
  • MossImageDiT.blockStreamed (cyclomatic 26) Sources/Siliconed/MossImage.swift:449 — MossImageDiT.blockStreamed has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · QwenImage21DiT.layerPass (cyclomatic 26) · ×1
  • QwenImage21DiT.layerPass (cyclomatic 26) Sources/Siliconed/QwenImage21.swift:595 — QwenImage21DiT.layerPass has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · MapWriter.write (cyclomatic 26) · ×1
  • MapWriter.write (cyclomatic 26) Sources/Siliconed/Forge/Map.swift:290 — MapWriter.write has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body's own statements and 5 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 · Parser.value (cyclomatic 26) · ×1
  • Parser.value (cyclomatic 26) Sources/Siliconed/Forge/OrderedJSON.swift:122 — Parser.value 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 · AppState.restoreSettings (cyclomatic 26) · ×1
  • AppState.restoreSettings (cyclomatic 26) Sources/SiliconedApp/AppState+Render.swift:693 — AppState.restoreSettings has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · RemoteControl.library (cyclomatic 26) · ×1
  • RemoteControl.library (cyclomatic 26) Sources/SiliconedApp/RemoteControl+Place.swift:121 — RemoteControl.library has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body's own statements and 8 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 · Img2ImgStages.run (cyclomatic 26) · ×1
  • Img2ImgStages.run (cyclomatic 26) Sources/Verification/Img2ImgStages.swift:296 — Img2ImgStages.run 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 · MeasureOptions.parse (cyclomatic 25) · ×1
  • MeasureOptions.parse (cyclomatic 25) Sources/Measurement/Series.swift:29 — MeasureOptions.parse has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Context.convolution (cyclomatic 25) · ×1
  • Context.convolution (cyclomatic 25) Sources/Siliconed/CapacityProbesConvolution.swift:23 — Context.convolution has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body's own statements and 4 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 · CapacityDisk.measureClasses (cyclomatic 24) · ×1
  • CapacityDisk.measureClasses (cyclomatic 24) Sources/Siliconed/CapacityDisk.swift:183 — CapacityDisk.measureClasses 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 · CapacityPlan.init (cyclomatic 24) · ×1
  • CapacityPlan.init (cyclomatic 24) Sources/Siliconed/CapacityPlan.swift:191 — CapacityPlan.init has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body's own statements and 1 belongs to one function item 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 · ProductSolver.timed (cyclomatic 24) · ×1
  • ProductSolver.timed (cyclomatic 24) Sources/Siliconed/CapacitySolver.swift:728 — ProductSolver.timed 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 · MemoryPlan.choose (cyclomatic 24) · ×1
  • MemoryPlan.choose (cyclomatic 24) Sources/Siliconed/MemoryPlan.swift:124 — MemoryPlan.choose has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · VAEEncoder.init (cyclomatic 24) · ×1
  • VAEEncoder.init (cyclomatic 24) Sources/Siliconed/VAEEncoder.swift:113 — VAEEncoder.init has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · RemoteLink.attempt (cyclomatic 24) · ×1
  • RemoteLink.attempt (cyclomatic 24) Sources/Siliconed/Remote/Link.swift:113 — RemoteLink.attempt 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 · Artifact.scale (cyclomatic 23) · ×1
  • Artifact.scale (cyclomatic 23) Sources/Siliconed/Artifact.swift:370 — Artifact.scale has cyclomatic complexity 23 (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 · MainWindow.watchKeys (cyclomatic 23) · ×1
  • MainWindow.watchKeys (cyclomatic 23) Sources/SiliconedApp/App.swift:546 — MainWindow.watchKeys 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 · AppState.perform (cyclomatic 23) · ×1
  • AppState.perform (cyclomatic 23) Sources/SiliconedApp/AppState+Library.swift:71 — AppState.perform 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 · RemoteControl.addGrid (cyclomatic 23) · ×1
  • RemoteControl.addGrid (cyclomatic 23) Sources/SiliconedApp/RemoteControl+Add.swift:381 — RemoteControl.addGrid has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body's own statements and 4 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 · CapacityFit.overlap (cyclomatic 22) · ×1
  • CapacityFit.overlap (cyclomatic 22) Sources/Siliconed/CapacityFit.swift:553 — CapacityFit.overlap 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 · ImageRGB.straightRGBA (cyclomatic 22) · ×1
  • ImageRGB.straightRGBA (cyclomatic 22) Sources/Siliconed/ImageToImage.swift:153 — ImageRGB.straightRGBA has cyclomatic complexity 22 (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 · DiT.forward (cyclomatic 22) · ×1
  • DiT.forward (cyclomatic 22) Sources/Siliconed/DiT.swift:191 — DiT.forward has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · GEMM.accumulatedLinear (cyclomatic 22) · ×1
  • GEMM.accumulatedLinear (cyclomatic 22) Sources/Siliconed/GEMM.swift:523 — GEMM.accumulatedLinear 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 · Krea2DiT.blockStreamed (cyclomatic 22) · ×1
  • Krea2DiT.blockStreamed (cyclomatic 22) Sources/Siliconed/Krea2.swift:451 — Krea2DiT.blockStreamed has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body's own statements and 2 belong to 2 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 · Qwen3VLDecoder.run (cyclomatic 22) · ×1
  • Qwen3VLDecoder.run (cyclomatic 22) Sources/Siliconed/Qwen3VLDecoder.swift:279 — Qwen3VLDecoder.run has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · QwenImage21DiT.layerStreamed (cyclomatic 22) · ×1
  • QwenImage21DiT.layerStreamed (cyclomatic 22) Sources/Siliconed/QwenImage21.swift:739 — QwenImage21DiT.layerStreamed has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the 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 · WeightProducts.int8Plan (cyclomatic 22) · ×1
  • WeightProducts.int8Plan (cyclomatic 22) Sources/Siliconed/WeightProducts.swift:564 — WeightProducts.int8Plan 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 · ForgeDiT.order (cyclomatic 22) · ×1
  • ForgeDiT.order (cyclomatic 22) Sources/Siliconed/Forge/ForgeDiT.swift:90 — ForgeDiT.order 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 · MirrorLibraryHost.handle (cyclomatic 22) · ×1
  • MirrorLibraryHost.handle (cyclomatic 22) Sources/SiliconedApp/MirrorLibrary.swift:390 — MirrorLibraryHost.handle 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 · ForgeProgress.line (cyclomatic 22) · ×1
  • ForgeProgress.line (cyclomatic 22) Sources/SiliconedApp/Problems.swift:358 — ForgeProgress.line 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. This is NOT this file's highest cyclomatic complexity: Problem.suggestion (cyclomatic 55) 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 · RemoteControl.set (cyclomatic 22) · ×1
  • RemoteControl.set (cyclomatic 22) Sources/SiliconedApp/RemoteControl+Commands.swift:279 — RemoteControl.set 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 · RemoteControl.wait (cyclomatic 22) · ×1
  • RemoteControl.wait (cyclomatic 22) Sources/SiliconedApp/RemoteControl+Follow.swift:72 — RemoteControl.wait 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 · RemoteControl.followMirroredGrid (cyclomatic 22) · ×1
  • RemoteControl.followMirroredGrid (cyclomatic 22) Sources/SiliconedApp/RemoteControl+Mirror.swift:337 — RemoteControl.followMirroredGrid has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body's own statements and 10 belong to 2 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 · Recipe.init (cyclomatic 21) · ×1
  • Recipe.init (cyclomatic 21) Sources/Siliconed/Engine.swift:231 — Recipe.init has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 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 · MossImageForge.forgeLoRA (cyclomatic 21) · ×1
  • MossImageForge.forgeLoRA (cyclomatic 21) Sources/Siliconed/MossImageForge.swift:142 — MossImageForge.forgeLoRA 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 · Qwen3VLDecoder.init (cyclomatic 21) · ×1
  • Qwen3VLDecoder.init (cyclomatic 21) Sources/Siliconed/Qwen3VLDecoder.swift:177 — Qwen3VLDecoder.init 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 · RGB8.init (cyclomatic 21) · ×1
  • RGB8.init (cyclomatic 21) Sources/Siliconed/Qwen3VLImages.swift:66 — RGB8.init 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 · Downloader.download (cyclomatic 21) · ×1
  • Downloader.download (cyclomatic 21) Sources/Siliconed/Forge/Downloader.swift:97 — Downloader.download 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 · HubImport.examine (cyclomatic 21) · ×1
  • HubImport.examine (cyclomatic 21) Sources/Siliconed/Forge/HubLink.swift:206 — HubImport.examine 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 · MapComparison.compare (cyclomatic 21) · ×1
  • MapComparison.compare (cyclomatic 21) Sources/Siliconed/Forge/Map.swift:544 — MapComparison.compare 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 · AppState.enqueueGrid (cyclomatic 21) · ×1
  • AppState.enqueueGrid (cyclomatic 21) Sources/SiliconedApp/AppState+Render.swift:76 — AppState.enqueueGrid 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 · RemoteControl.writeInText (cyclomatic 21) · ×1
  • RemoteControl.writeInText (cyclomatic 21) Sources/SiliconedApp/RemoteControl+Lab.swift:82 — RemoteControl.writeInText 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 · RemoteControl.addGridOnMirror (cyclomatic 21) · ×1
  • RemoteControl.addGridOnMirror (cyclomatic 21) Sources/SiliconedApp/RemoteControl+Mirror.swift:257 — RemoteControl.addGridOnMirror has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 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 · FrameEditor.drag (cyclomatic 21) · ×1
  • FrameEditor.drag (cyclomatic 21) Sources/SiliconedApp/SubjectSheet.swift:335 — FrameEditor.drag 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 · GEMM.linear (cyclomatic 20) · ×1
  • GEMM.linear (cyclomatic 20) Sources/Siliconed/GEMM.swift:297 — GEMM.linear 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 · HeadSplitAttention.init (cyclomatic 20) · ×1
  • HeadSplitAttention.init (cyclomatic 20) Sources/Siliconed/HeadSplitAttention.swift:212 — HeadSplitAttention.init has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RenderGrid.cells (cyclomatic 20) · ×1
  • RenderGrid.cells (cyclomatic 20) Sources/Siliconed/RenderGrid.swift:276 — RenderGrid.cells 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 · WeightProducts.prepareSQ (cyclomatic 20) · ×1
  • WeightProducts.prepareSQ (cyclomatic 20) Sources/Siliconed/WeightProducts.swift:961 — WeightProducts.prepareSQ has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · QuantizedTensor.absMax (cyclomatic 20) · ×1
  • QuantizedTensor.absMax (cyclomatic 20) Sources/Siliconed/Forge/Quantization.swift:175 — QuantizedTensor.absMax 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 · MainWindow.key (cyclomatic 20) · ×1
  • MainWindow.key (cyclomatic 20) Sources/SiliconedApp/App.swift:594 — MainWindow.key 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 · AppState.formBlocker (cyclomatic 20) · ×1
  • AppState.formBlocker (cyclomatic 20) Sources/SiliconedApp/AppState+Catalog.swift:73 — AppState.formBlocker 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 · Context.chooseTiles (cyclomatic 19) · ×1
  • Context.chooseTiles (cyclomatic 19) Sources/Siliconed/CapacityProbesSolos.swift:108 — Context.chooseTiles has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (run, decide, summed). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · QwenImage21Sequence.init (cyclomatic 19) · ×1
  • QwenImage21Sequence.init (cyclomatic 19) Sources/Siliconed/QwenImage21.swift:1136 — QwenImage21Sequence.init 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 · TextEncoder.encode (cyclomatic 19) · ×1
  • TextEncoder.encode (cyclomatic 19) Sources/Siliconed/TextEncoder.swift:395 — TextEncoder.encode 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 · WeightProducts.plannedInt8 (cyclomatic 19) · ×1
  • WeightProducts.plannedInt8 (cyclomatic 19) Sources/Siliconed/WeightProducts.swift:812 — WeightProducts.plannedInt8 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 · Widen.dequantizePacked (cyclomatic 19) · ×1
  • Widen.dequantizePacked (cyclomatic 19) Sources/Siliconed/Widen.swift:623 — Widen.dequantizePacked has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body's own statements and 6 belong to one function item 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.
D1 · Cyclomatic Complexity · Report.rows (cyclomatic 19) · ×1
  • Report.rows (cyclomatic 19) Sources/Siliconed/Forge/ForgeDiT.swift:44 — Report.rows 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 · ForgeLoRA.candidates (cyclomatic 19) · ×1
  • ForgeLoRA.candidates (cyclomatic 19) Sources/Siliconed/Forge/ForgeLoRA.swift:294 — ForgeLoRA.candidates 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.
D1 · Cyclomatic Complexity · RemoteHost.pair (cyclomatic 19) · ×1
  • RemoteHost.pair (cyclomatic 19) Sources/Siliconed/Remote/Host.swift:321 — RemoteHost.pair 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 · AppState.open (cyclomatic 19) · ×1
  • AppState.open (cyclomatic 19) Sources/SiliconedApp/AppState+Hub.swift:34 — AppState.open 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 · AppState.sheetDrawing (cyclomatic 19) · ×1
  • AppState.sheetDrawing (cyclomatic 19) Sources/SiliconedApp/AppState+Render.swift:211 — AppState.sheetDrawing has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body's own statements and 3 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 · RemoteControl.followGrid (cyclomatic 19) · ×1
  • RemoteControl.followGrid (cyclomatic 19) Sources/SiliconedApp/RemoteControl+Follow.swift:13 — RemoteControl.followGrid has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 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 · AnimaConditioner.condition (cyclomatic 18) · ×1
  • AnimaConditioner.condition (cyclomatic 18) Sources/Siliconed/AnimaConditioner.swift:221 — AnimaConditioner.condition has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · CapacityFit.shapedLine (cyclomatic 18) · ×1
  • CapacityFit.shapedLine (cyclomatic 18) Sources/Siliconed/CapacityFit.swift:397 — CapacityFit.shapedLine has cyclomatic complexity 18 (threshold 15). Of this number, 15 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 · PromptDiff.pieces (cyclomatic 18) · ×1
  • PromptDiff.pieces (cyclomatic 18) Sources/Siliconed/PromptDiff.swift:31 — PromptDiff.pieces has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong 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 · QwenImage21DiT.init (cyclomatic 18) · ×1
  • QwenImage21DiT.init (cyclomatic 18) Sources/Siliconed/QwenImage21.swift:292 — QwenImage21DiT.init 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 · Sampler.run (cyclomatic 18) · ×1
  • Sampler.run (cyclomatic 18) Sources/Siliconed/Sampler.swift:131 — Sampler.run 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 · TiledAttention.submit (cyclomatic 18) · ×1
  • TiledAttention.submit (cyclomatic 18) Sources/Siliconed/TiledAttention.swift:240 — TiledAttention.submit 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 · WeightProducts.inPlaceInt8 (cyclomatic 18) · ×1
  • WeightProducts.inPlaceInt8 (cyclomatic 18) Sources/Siliconed/WeightProducts.swift:845 — WeightProducts.inPlaceInt8 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 · RemoteHost.admit (cyclomatic 18) · ×1
  • RemoteHost.admit (cyclomatic 18) Sources/Siliconed/Remote/Host.swift:194 — RemoteHost.admit 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 · ModulesAnima.swift.euler (cyclomatic 18) · ×1
  • ModulesAnima.swift.euler (cyclomatic 18) Sources/Siliconed/ModulesAnima.swift:210 — ModulesAnima.swift.euler 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 · AppCommands.body (cyclomatic 18) · ×1
  • AppCommands.body (cyclomatic 18) Sources/SiliconedApp/App.swift:53 — AppCommands.body 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 · MirrorServer.admit (cyclomatic 18) · ×1
  • MirrorServer.admit (cyclomatic 18) Sources/SiliconedApp/MirrorServer.swift:327 — MirrorServer.admit 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 · RemoteControl.follow (cyclomatic 18) · ×1
  • RemoteControl.follow (cyclomatic 18) Sources/SiliconedApp/RemoteControl+Follow.swift:172 — RemoteControl.follow has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong 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 · RemoteControl.uninstall (cyclomatic 18) · ×1
  • RemoteControl.uninstall (cyclomatic 18) Sources/SiliconedApp/RemoteControl+Gestures.swift:357 — RemoteControl.uninstall 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 · RemoteControl.lab (cyclomatic 18) · ×1
  • RemoteControl.lab (cyclomatic 18) Sources/SiliconedApp/RemoteControl+Lab.swift:21 — RemoteControl.lab has cyclomatic complexity 18 (threshold 15). Of this number, 17 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 · CapacityFit.thinFit (cyclomatic 17) · ×1
  • CapacityFit.thinFit (cyclomatic 17) Sources/Siliconed/CapacityFit.swift:460 — CapacityFit.thinFit has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function item 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 · Admission.judge (cyclomatic 17) · ×1
  • Admission.judge (cyclomatic 17) Sources/Siliconed/EngineAdmission.swift:30 — Admission.judge 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 · MemoryNeed.gemm (cyclomatic 17) · ×1
  • MemoryNeed.gemm (cyclomatic 17) Sources/Siliconed/MemoryNeed.swift:416 — MemoryNeed.gemm has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body's own statements and 7 belong to one function item 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 · PromptDiff.align (cyclomatic 17) · ×1
  • PromptDiff.align (cyclomatic 17) Sources/Siliconed/PromptDiff.swift:109 — PromptDiff.align 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 · Qwen3VLDecoder.make · ×1
  • Qwen3VLDecoder.make::matrix (cyclomatic 17) Sources/Siliconed/Qwen3VLDecoder.swift:424 — Qwen3VLDecoder.make::matrix has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Config.init (cyclomatic 17) · ×1
  • Config.init (cyclomatic 17) Sources/Siliconed/Qwen3VLVision.swift:60 — Config.init has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SetOrder.parse (cyclomatic 17) · ×1
  • SetOrder.parse (cyclomatic 17) Sources/Siliconed/RemoteWriting.swift:228 — SetOrder.parse 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 · TiledAttention.init (cyclomatic 17) · ×1
  • TiledAttention.init (cyclomatic 17) Sources/Siliconed/TiledAttention.swift:118 — TiledAttention.init has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 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 · ForgeQwen35.plan (cyclomatic 17) · ×1
  • ForgeQwen35.plan (cyclomatic 17) Sources/Siliconed/Forge/ForgeQwen35.swift:49 — ForgeQwen35.plan 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 · HubImport.contentRanges (cyclomatic 17) · ×1
  • HubImport.contentRanges (cyclomatic 17) Sources/Siliconed/Forge/HubLink.swift:259 — HubImport.contentRanges has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Parser.chain (cyclomatic 17) · ×1
  • Parser.chain (cyclomatic 17) Sources/Siliconed/Forge/OrderedJSON.swift:187 — Parser.chain 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 · AppState.next (cyclomatic 17) · ×1
  • AppState.next (cyclomatic 17) Sources/SiliconedApp/AppState+Render.swift:279 — AppState.next 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 · LicenseTerms.body (cyclomatic 17) · ×1
  • LicenseTerms.body (cyclomatic 17) Sources/SiliconedApp/LicenseSheet.swift:29 — LicenseTerms.body has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · PromptTextView.varyTarget (cyclomatic 17) · ×1
  • PromptTextView.varyTarget (cyclomatic 17) Sources/SiliconedApp/PromptField.swift:378 — PromptTextView.varyTarget 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 · RemoteControl.install (cyclomatic 17) · ×1
  • RemoteControl.install (cyclomatic 17) Sources/SiliconedApp/RemoteControl+Commands.swift:19 — RemoteControl.install 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 · RemoteControl.crop (cyclomatic 17) · ×1
  • RemoteControl.crop (cyclomatic 17) Sources/SiliconedApp/RemoteControl+Gestures.swift:237 — RemoteControl.crop 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 · RemoteControl.writing (cyclomatic 17) · ×1
  • RemoteControl.writing (cyclomatic 17) Sources/SiliconedApp/RemoteControl+Writer.swift:17 — RemoteControl.writing 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 · SceneView.body (cyclomatic 17) · ×1
  • SceneView.body (cyclomatic 17) Sources/SiliconedApp/SceneView.swift:32 — SceneView.body has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Block.forwardStreamed (cyclomatic 16) · ×1
  • Block.forwardStreamed (cyclomatic 16) Sources/Siliconed/Block.swift:292 — Block.forwardStreamed has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Diagnostic.measureWidening (cyclomatic 16) · ×1
  • Diagnostic.measureWidening (cyclomatic 16) Sources/Siliconed/DiagnosticWideningProbes.swift:28 — Diagnostic.measureWidening has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EngineSettings.init (cyclomatic 16) · ×1
  • EngineSettings.init (cyclomatic 16) Sources/Siliconed/EngineSettings.swift:256 — EngineSettings.init 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 · PNG.text (cyclomatic 16) · ×1
  • PNG.text (cyclomatic 16) Sources/Siliconed/ImagePNG.swift:118 — PNG.text 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 · TailStream.init (cyclomatic 16) · ×1
  • TailStream.init (cyclomatic 16) Sources/Siliconed/Prefetcher.swift:233 — TailStream.init 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.
D1 · Cyclomatic Complexity · Qwen35Encoder.encode (cyclomatic 16) · ×1
  • Qwen35Encoder.encode (cyclomatic 16) Sources/Siliconed/Qwen35.swift:462 — Qwen35Encoder.encode 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 · QwenImage21VAE.run (cyclomatic 16) · ×1
  • QwenImage21VAE.run (cyclomatic 16) Sources/Siliconed/QwenImage21VAE.swift:294 — QwenImage21VAE.run 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 · Widen.dequantize (cyclomatic 16) · ×1
  • Widen.dequantize (cyclomatic 16) Sources/Siliconed/Widen.swift:129 — Widen.dequantize has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong 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 · QuantizedTensor.dequantized (cyclomatic 16) · ×1
  • QuantizedTensor.dequantized (cyclomatic 16) Sources/Siliconed/Forge/Quantization.swift:52 — QuantizedTensor.dequantized 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.
D1 · Cyclomatic Complexity · AppState.receiveLibrary (cyclomatic 16) · ×1
  • AppState.receiveLibrary (cyclomatic 16) Sources/SiliconedApp/MirrorLibrary.swift:80 — AppState.receiveLibrary 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 · main.swift.top-level code (cyclomatic 16) · ×1
  • main.swift.top-level code (cyclomatic 16) Sources/Silicontrol/main.swift:21 — main.swift.top-level code 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 · Clouds.arbitrate (cyclomatic 16) · ×1
  • Clouds.arbitrate (cyclomatic 16) Sources/Verification/Krea2Stages.swift:428 — Clouds.arbitrate 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.
D2 · Cognitive Complexity · QuantizedLayouts.recognize (cognitive 201) · ×1
  • QuantizedLayouts.recognize (cognitive 201) Sources/Siliconed/Forge/Quantization.swift:430 — QuantizedLayouts.recognize has cognitive complexity 201 (threshold 15). Drivers by points: if/else 57 (116 pts), boolean chains 48, ternaries 8 (20 pts), loops 12 (15 pts), match/switch 1 (2 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GestureOrder.parse (cognitive 176) · ×1
  • GestureOrder.parse (cognitive 176) Sources/Siliconed/RemoteGestures.swift:232 — GestureOrder.parse has cognitive complexity 176 (threshold 15). Drivers by points: if/else 43 (93 pts), ternaries 20 (52 pts), boolean chains 20, match/switch 6 (10 pts), loops 1 (nesting depth added 86). Of this number, 173 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ForgeLoRA.forging (cognitive 139) · ×1
  • ForgeLoRA.forging (cognitive 139) Sources/Siliconed/Forge/ForgeLoRA.swift:420 — ForgeLoRA.forging has cognitive complexity 139 (threshold 15). Drivers by points: if/else 49 (88 pts), boolean chains 24, loops 10 (20 pts), ternaries 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 52). Of this number, 119 points are the body's own statements and 20 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 · Context.attention (cognitive 108) · ×1
  • Context.attention (cognitive 108) Sources/Siliconed/CapacityProbesSolos.swift:322 — Context.attention has cognitive complexity 108 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 25, loops 7 (19 pts), match/switch 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 53). Of this number, 90 points are the body's own statements and 18 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · CapacityPlan.forcing (cognitive 107) · ×1
  • CapacityPlan.forcing (cognitive 107) Sources/Siliconed/CapacityPlan.swift:756 — CapacityPlan.forcing has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 32, ternaries 20 (27 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ForgeDiT.tensor (cognitive 95) · ×1
  • ForgeDiT.tensor (cognitive 95) Sources/Siliconed/Forge/ForgeDiT.swift:357 — ForgeDiT.tensor has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 17 (33 pts), if/else 19 (31 pts), boolean chains 29, loops 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.add (cognitive 95) · ×1
  • RemoteControl.add (cognitive 95) Sources/SiliconedApp/RemoteControl+Add.swift:121 — RemoteControl.add has cognitive complexity 95 (threshold 15). Drivers by points: if/else 43 (59 pts), boolean chains 20, ternaries 6 (10 pts), error handling 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 · WeightProducts.linear (cognitive 90) · ×1
  • WeightProducts.linear (cognitive 90) Sources/Siliconed/WeightProducts.swift:278 — WeightProducts.linear has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (46 pts), boolean chains 31, ternaries 7 (12 pts), match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Recipes.normalize (cognitive 85) · ×1
  • Recipes.normalize (cognitive 85) Sources/Siliconed/Forge/Families.swift:345 — Recipes.normalize has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 9 (23 pts), boolean chains 11, ternaries 5 (10 pts), match/switch 1 (nesting depth added 42). Of this number, 84 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RenderGrid.init (cognitive 84) · ×1
  • RenderGrid.init (cognitive 84) Sources/Siliconed/RenderGrid.swift:164 — RenderGrid.init has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (69 pts), boolean chains 6, ternaries 2 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Installer.install (cognitive 81) · ×1
  • Installer.install (cognitive 81) Sources/Siliconed/Forge/Installation.swift:536 — Installer.install has cognitive complexity 81 (threshold 15). Drivers by points: if/else 23 (35 pts), ternaries 10 (21 pts), loops 6 (13 pts), boolean chains 12 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NeuralEngine.run (cognitive 75) · ×1
  • NeuralEngine.run (cognitive 75) Sources/Siliconed/NeuralEngine.swift:284 — NeuralEngine.run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (41 pts), ternaries 6 (14 pts), loops 7 (11 pts), boolean chains 4, match/switch 2 (3 pts), error handling 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AppState.receive (cognitive 70) · ×1
  • AppState.receive (cognitive 70) Sources/SiliconedApp/AppState+Mirror.swift:266 — AppState.receive has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 9, loops 3 (7 pts), ternaries 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 32). Of this number, 68 points are the body's own statements and 2 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 · Context.validate (cognitive 69) · ×1
  • Context.validate (cognitive 69) Sources/Siliconed/CapacityProbesValidation.swift:14 — Context.validate has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 11 (22 pts), boolean chains 5 (nesting depth added 38). Of this number, 63 points are the body's own statements and 6 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 · AppState.execute (cognitive 69) · ×1
  • AppState.execute (cognitive 69) Sources/SiliconedApp/AppState+Render.swift:359 — AppState.execute has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 5 (15 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.addOnMirror (cognitive 68) · ×1
  • RemoteControl.addOnMirror (cognitive 68) Sources/SiliconedApp/RemoteControl+Mirror.swift:74 — RemoteControl.addOnMirror has cognitive complexity 68 (threshold 15). Drivers by points: if/else 33 (41 pts), boolean chains 15, error handling 3 (5 pts), loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 12). Of this number, 55 points are the body's own statements and 13 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 · Context.solo (cognitive 66) · ×1
  • Context.solo (cognitive 66) Sources/Siliconed/CapacityProbesSolos.swift:194 — Context.solo has cognitive complexity 66 (threshold 15). Drivers by points: boolean chains 28, if/else 14 (22 pts), ternaries 8 (15 pts), match/switch 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 · Qwen3VLGenerator.generate (cognitive 66) · ×1
  • Qwen3VLGenerator.generate (cognitive 66) Sources/Siliconed/Qwen3VLGeneration.swift:259 — Qwen3VLGenerator.generate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 9 (17 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 28). Of this number, 62 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 · GGUF.parse (cognitive 61) · ×1
  • GGUF.parse (cognitive 61) Sources/Siliconed/Forge/GGUF.swift:90 — GGUF.parse has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (37 pts), loops 7 (9 pts), boolean chains 7, match/switch 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 18). Of this number, 39 points are the body's own statements and 22 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 · Krea2PermutedMap.write (cognitive 61) · ×1
  • Krea2PermutedMap.write (cognitive 61) Sources/Verification/ResidualPermutation.swift:203 — Krea2PermutedMap.write has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 13, loops 4 (10 pts), ternaries 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 21). Of this number, 51 points are the body's own statements and 10 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 · ProductSolver.evaluate (cognitive 59) · ×1
  • ProductSolver.evaluate (cognitive 59) Sources/Siliconed/CapacitySolver.swift:674 — ProductSolver.evaluate has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (46 pts), ternaries 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.parse (cognitive 58) · ×1
  • RemoteControl.parse (cognitive 58) Sources/SiliconedApp/RemoteControl+Add.swift:11 — RemoteControl.parse has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 9, match/switch 2 (6 pts), error handling 1 (3 pts), loops 2 (nesting depth added 26). Of this number, 57 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImage21DiT.body (cognitive 56) · ×1
  • QwenImage21DiT.body (cognitive 56) Sources/Siliconed/QwenImage21.swift:452 — QwenImage21DiT.body has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (33 pts), loops 5 (10 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CapacityFit.model (cognitive 55) · ×1
  • CapacityFit.model (cognitive 55) Sources/Siliconed/CapacityFit.swift:687 — CapacityFit.model has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 11, loops 10 (11 pts), ternaries 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Artifact.parse (cognitive 53) · ×1
  • Artifact.parse (cognitive 53) Sources/Siliconed/Artifact.swift:280 — Artifact.parse has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 18, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProductAssignment.isRunnable (cognitive 52) · ×1
  • ProductAssignment.isRunnable (cognitive 52) Sources/Siliconed/CapacityPlan.swift:574 — ProductAssignment.isRunnable has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 33, if/else 11 (18 pts), match/switch 1 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · QwenImage21Sampler.run (cognitive 52) · ×1
  • QwenImage21Sampler.run (cognitive 52) Sources/Siliconed/QwenImage21Sampler.swift:83 — QwenImage21Sampler.run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 10 (17 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Runner.run (cognitive 48) · ×1
  • Runner.run (cognitive 48) Sources/Measurement/Runner.swift:27 — Runner.run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 9, ternaries 5 (7 pts), error handling 2 (4 pts), loops 3 (nesting depth added 11). Of this number, 42 points are the body's own statements and 6 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 · ProductSolver.widened (cognitive 47) · ×1
  • ProductSolver.widened (cognitive 47) Sources/Siliconed/CapacitySolver.swift:375 — ProductSolver.widened has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 22, if/else 15 (18 pts), loops 2 (5 pts), ternaries 2 (nesting depth added 6). Of this number, 37 points are the body's own statements and 10 belong to 2 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 · Tokenizer.init (cognitive 47) · ×1
  • Tokenizer.init (cognitive 47) Sources/Siliconed/Tokenizer.swift:86 — Tokenizer.init has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 7 (11 pts), boolean chains 10, ternaries 2 (4 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.subjects (cognitive 47) · ×1
  • RemoteControl.subjects (cognitive 47) Sources/SiliconedApp/RemoteControl+Commands.swift:156 — RemoteControl.subjects has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 23). Of this number, 45 points are the body's own statements and 2 belong to one function item 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 · RenderGrid.axis (cognitive 45) · ×1
  • RenderGrid.axis (cognitive 45) Sources/Siliconed/RenderGrid.swift:357 — RenderGrid.axis has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 5 (10 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 18). Of this number, 41 points are the body's own statements and 4 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 · WeightProducts.prepare (cognitive 45) · ×1
  • WeightProducts.prepare (cognitive 45) Sources/Siliconed/WeightProducts.swift:874 — WeightProducts.prepare has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 20, if/else 14 (20 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 8). Of this number, 44 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Context.trial (cognitive 44) · ×1
  • Context.trial (cognitive 44) Sources/Siliconed/CapacityProbesSharing.swift:231 — Context.trial has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 10 (13 pts), boolean chains 9, loops 3 (nesting depth added 6). Of this number, 27 points are the body's own statements and 17 belong to 2 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 · Engine.execute (cognitive 43) · ×1
  • Engine.execute (cognitive 43) Sources/Siliconed/EngineRender.swift:52 — Engine.execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, loops 5 (6 pts), ternaries 5 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · T5Tokenizer.init (cognitive 42) · ×1
  • T5Tokenizer.init (cognitive 42) Sources/Siliconed/T5Tokenizer.swift:45 — T5Tokenizer.init has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 27, if/else 10 (13 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Attention.init (cognitive 40) · ×1
  • Attention.init (cognitive 40) Sources/Siliconed/Attention.swift:106 — Attention.init has cognitive complexity 40 (threshold 15). Drivers by points: loops 6 (14 pts), ternaries 7 (13 pts), boolean chains 8, if/else 5 (nesting depth added 14). Of this number, 39 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MapWriter.write (cognitive 40) · ×1
  • MapWriter.write (cognitive 40) Sources/Siliconed/Forge/Map.swift:290 — MapWriter.write has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 8 (13 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 15). Of this number, 30 points are the body's own statements and 10 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 · EngineError.init (cognitive 39) · ×1
  • EngineError.init (cognitive 39) Sources/Siliconed/Errors.swift:474 — EngineError.init has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 13 (25 pts), ternaries 2 (6 pts), if/else 4 (5 pts), boolean chains 3 (nesting depth added 17). 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 · ForgeLoRA.targets (cognitive 39) · ×1
  • ForgeLoRA.targets (cognitive 39) Sources/Siliconed/Forge/ForgeLoRA.swift:325 — ForgeLoRA.targets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 10, ternaries 1 (3 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 · CapacityDisk.measureClasses (cognitive 38) · ×1
  • CapacityDisk.measureClasses (cognitive 38) Sources/Siliconed/CapacityDisk.swift:183 — CapacityDisk.measureClasses has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 8 (13 pts), boolean chains 4, 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.
D2 · Cognitive Complexity · Qwen3VLImages.pixels (cognitive 38) · ×1
  • Qwen3VLImages.pixels (cognitive 38) Sources/Siliconed/Qwen3VLImages.swift:134 — Qwen3VLImages.pixels has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 2 (nesting depth added 28). 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 · RemoteControl.addGrid (cognitive 38) · ×1
  • RemoteControl.addGrid (cognitive 38) Sources/SiliconedApp/RemoteControl+Add.swift:381 — RemoteControl.addGrid has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 4 (7 pts), ternaries 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 14). Of this number, 28 points are the body's own statements and 10 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 · ProductSolver.native (cognitive 37) · ×1
  • ProductSolver.native (cognitive 37) Sources/Siliconed/CapacitySolver.swift:437 — ProductSolver.native has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 18, if/else 12 (16 pts), ternaries 3 (nesting depth added 4). Of this number, 30 points are the body's own statements and 7 belong to 2 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 · ImageRGB.straightRGBA (cognitive 37) · ×1
  • ImageRGB.straightRGBA (cognitive 37) Sources/Siliconed/ImageToImage.swift:153 — ImageRGB.straightRGBA has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 11, loops 3 (10 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Qwen3VLDecoder.run (cognitive 37) · ×1
  • Qwen3VLDecoder.run (cognitive 37) Sources/Siliconed/Qwen3VLDecoder.swift:279 — Qwen3VLDecoder.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 16). Of this number, 34 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Safetensors.init (cognitive 37) · ×1
  • Safetensors.init (cognitive 37) Sources/Siliconed/Safetensors.swift:58 — Safetensors.init has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11, loops 3 (5 pts), match/switch 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 · AppState.perform (cognitive 37) · ×1
  • AppState.perform (cognitive 37) Sources/SiliconedApp/AppState+Library.swift:71 — AppState.perform has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 2 (8 pts), boolean chains 5, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.addGridOnMirror (cognitive 37) · ×1
  • RemoteControl.addGridOnMirror (cognitive 37) Sources/SiliconedApp/RemoteControl+Mirror.swift:257 — RemoteControl.addGridOnMirror has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (7 pts), boolean chains 3, error handling 2, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 27 points are the body's own statements and 10 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 · Context.trialPair (cognitive 36) · ×1
  • Context.trialPair (cognitive 36) Sources/Siliconed/CapacityProbesSharing.swift:88 — Context.trialPair has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 10, ternaries 3 (6 pts), loops 2 (nesting depth added 7). Of this number, 34 points are the body's own statements and 2 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 · HeadSplitAttention.init (cognitive 36) · ×1
  • HeadSplitAttention.init (cognitive 36) Sources/Siliconed/HeadSplitAttention.swift:212 — HeadSplitAttention.init has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 5 (9 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 13). Of this number, 33 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Qwen3VLDecoder.init (cognitive 36) · ×1
  • Qwen3VLDecoder.init (cognitive 36) Sources/Siliconed/Qwen3VLDecoder.swift:177 — Qwen3VLDecoder.init has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 7 (15 pts), boolean chains 4 (nesting depth added 15). Of this number, 34 points are the body's own statements and 2 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 · QwenImageWriterStages.check (cognitive 36) · ×1
  • QwenImageWriterStages.check (cognitive 36) Sources/Verification/QwenImageWriterStages.swift:119 — QwenImageWriterStages.check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 10, boolean chains 8, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · InstructionOrder.parse (cognitive 35) · ×1
  • InstructionOrder.parse (cognitive 35) Sources/Siliconed/RemoteWriting.swift:137 — InstructionOrder.parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ForgeLoRA.candidates (cognitive 35) · ×1
  • ForgeLoRA.candidates (cognitive 35) Sources/Siliconed/Forge/ForgeLoRA.swift:294 — ForgeLoRA.candidates has cognitive complexity 35 (threshold 15). Drivers by points: loops 10 (28 pts), ternaries 3 (6 pts), match/switch 1 (nesting depth added 21). 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 · RemoteControl.handle (cognitive 35) · ×1
  • RemoteControl.handle (cognitive 35) Sources/SiliconedApp/RemoteControl.swift:78 — RemoteControl.handle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 3 (9 pts), error handling 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.library (cognitive 35) · ×1
  • RemoteControl.library (cognitive 35) Sources/SiliconedApp/RemoteControl+Place.swift:121 — RemoteControl.library has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (2 pts), match/switch 1, ternaries 1 (nesting depth added 12). Of this number, 27 points are the body's own statements and 8 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 · Invocation.init (cognitive 34) · ×1
  • Invocation.init (cognitive 34) Sources/Verification/Invocation.swift:55 — Invocation.init has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 12 (16 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · QwenImage21VAE.run (cognitive 33) · ×1
  • QwenImage21VAE.run (cognitive 33) Sources/Siliconed/QwenImage21VAE.swift:294 — QwenImage21VAE.run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.wait (cognitive 33) · ×1
  • RemoteControl.wait (cognitive 33) Sources/SiliconedApp/RemoteControl+Follow.swift:72 — RemoteControl.wait has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MossImageStages.evaluate (cognitive 33) · ×1
  • MossImageStages.evaluate (cognitive 33) Sources/Verification/MossImageStages.swift:149 — MossImageStages.evaluate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 8, ternaries 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Context.convolution (cognitive 32) · ×1
  • Context.convolution (cognitive 32) Sources/Siliconed/CapacityProbesConvolution.swift:23 — Context.convolution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, ternaries 5 (8 pts), loops 3 (4 pts) (nesting depth added 8). Of this number, 28 points are the body's own statements and 4 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 · QwenImage21VAEDecoder.tail (cognitive 32) · ×1
  • QwenImage21VAEDecoder.tail (cognitive 32) Sources/Siliconed/QwenImage21VAE.swift:635 — QwenImage21VAEDecoder.tail has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 4 (9 pts), ternaries 4 (8 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 · MapComparison.compare (cognitive 32) · ×1
  • MapComparison.compare (cognitive 32) Sources/Siliconed/Forge/Map.swift:544 — MapComparison.compare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.value (cognitive 32) · ×1
  • Parser.value (cognitive 32) Sources/Siliconed/Forge/OrderedJSON.swift:122 — Parser.value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 3 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CapacityModel.split (cognitive 31) · ×1
  • CapacityModel.split (cognitive 31) Sources/Siliconed/CapacityModel.swift:621 — CapacityModel.split has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), ternaries 2 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RGB8.init (cognitive 31) · ×1
  • RGB8.init (cognitive 31) Sources/Siliconed/Qwen3VLImages.swift:66 — RGB8.init has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (9 pts), loops 3 (6 pts), ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sampler.run (cognitive 31) · ×1
  • Sampler.run (cognitive 31) Sources/Siliconed/Sampler.swift:131 — Sampler.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 5 (6 pts), loops 2 (4 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.
D2 · Cognitive Complexity · ForgeDiT.order (cognitive 31) · ×1
  • ForgeDiT.order (cognitive 31) Sources/Siliconed/Forge/ForgeDiT.swift:90 — ForgeDiT.order has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 2, match/switch 1 (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 · AppState.restoreSettings (cognitive 31) · ×1
  • AppState.restoreSettings (cognitive 31) Sources/SiliconedApp/AppState+Render.swift:693 — AppState.restoreSettings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, 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, 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 · CapacityFit.overlap (cognitive 30) · ×1
  • CapacityFit.overlap (cognitive 30) Sources/Siliconed/CapacityFit.swift:553 — CapacityFit.overlap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (8 pts), boolean chains 6, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProductSolver.timed (cognitive 30) · ×1
  • ProductSolver.timed (cognitive 30) Sources/Siliconed/CapacitySolver.swift:728 — ProductSolver.timed has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, ternaries 3 (6 pts), match/switch 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 · PNG.text (cognitive 30) · ×1
  • PNG.text (cognitive 30) Sources/Siliconed/ImagePNG.swift:118 — PNG.text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (10 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MossImageDiT.blockStreamed (cognitive 30) · ×1
  • MossImageDiT.blockStreamed (cognitive 30) Sources/Siliconed/MossImage.swift:449 — MossImageDiT.blockStreamed has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (10 pts), loops 3 (5 pts), ternaries 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · PillowResample.lanczos (cognitive 30) · ×1
  • PillowResample.lanczos (cognitive 30) Sources/Siliconed/Qwen3VLImages.swift:272 — PillowResample.lanczos has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (28 pts), if/else 2 (nesting depth added 20). 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 · RenderLoop.compare (cognitive 30) · ×1
  • RenderLoop.compare (cognitive 30) Sources/Siliconed/RenderLoop.swift:182 — RenderLoop.compare has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 5 (10 pts), ternaries 2 (4 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 · TokenizerJSON.string (cognitive 30) · ×1
  • TokenizerJSON.string (cognitive 30) Sources/Siliconed/TokenizerTables.swift:173 — TokenizerJSON.string has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, match/switch 2 (4 pts), loops 3 (nesting depth added 10). Of this number, 23 points are the body's own statements and 7 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 · ForgeDiT.forge (cognitive 30) · ×1
  • ForgeDiT.forge (cognitive 30) Sources/Siliconed/Forge/ForgeDiT.swift:197 — ForgeDiT.forge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, loops 2 (3 pts), match/switch 2 (3 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · TailStream.init (cognitive 29) · ×1
  • TailStream.init (cognitive 29) Sources/Siliconed/Prefetcher.swift:233 — TailStream.init has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 7 (13 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 · TailStream.release (cognitive 29) · ×1
  • TailStream.release (cognitive 29) Sources/Siliconed/Prefetcher.swift:431 — TailStream.release has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImage21DiT.layerPass (cognitive 29) · ×1
  • QwenImage21DiT.layerPass (cognitive 29) Sources/Siliconed/QwenImage21.swift:595 — QwenImage21DiT.layerPass has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 10, loops 3 (4 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 · TextEncoder.encode (cognitive 29) · ×1
  • TextEncoder.encode (cognitive 29) Sources/Siliconed/TextEncoder.swift:395 — TextEncoder.encode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WeightProducts.int8Plan (cognitive 29) · ×1
  • WeightProducts.int8Plan (cognitive 29) Sources/Siliconed/WeightProducts.swift:564 — WeightProducts.int8Plan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 6 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteLink.attempt (cognitive 29) · ×1
  • RemoteLink.attempt (cognitive 29) Sources/Siliconed/Remote/Link.swift:113 — RemoteLink.attempt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ModulesAnima.swift.euler (cognitive 29) · ×1
  • ModulesAnima.swift.euler (cognitive 29) Sources/Siliconed/ModulesAnima.swift:210 — ModulesAnima.swift.euler has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 5 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DiT.forward (cognitive 28) · ×1
  • DiT.forward (cognitive 28) Sources/Siliconed/DiT.swift:191 — DiT.forward has cognitive complexity 28 (threshold 15). Drivers by points: loops 11 (13 pts), if/else 6 (8 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · MossImageForge.forgeLoRA (cognitive 28) · ×1
  • MossImageForge.forgeLoRA (cognitive 28) Sources/Siliconed/MossImageForge.swift:142 — MossImageForge.forgeLoRA has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, loops 3 (5 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 · RenderGrid.cells (cognitive 28) · ×1
  • RenderGrid.cells (cognitive 28) Sources/Siliconed/RenderGrid.swift:276 — RenderGrid.cells has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Img2ImgStages.run (cognitive 28) · ×1
  • Img2ImgStages.run (cognitive 28) Sources/Verification/Img2ImgStages.swift:296 — Img2ImgStages.run has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (9 pts), ternaries 3, loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · AnimaDiT.forward (cognitive 27) · ×1
  • AnimaDiT.forward (cognitive 27) Sources/Siliconed/Anima.swift:213 — AnimaDiT.forward has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GEMM.linear (cognitive 27) · ×1
  • GEMM.linear (cognitive 27) Sources/Siliconed/GEMM.swift:297 — GEMM.linear has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (7 pts), boolean chains 6 (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 · QwenImage21Sequence.init (cognitive 27) · ×1
  • QwenImage21Sequence.init (cognitive 27) Sources/Siliconed/QwenImage21.swift:1136 — QwenImage21Sequence.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 8 (12 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Report.rows (cognitive 27) · ×1
  • Report.rows (cognitive 27) Sources/Siliconed/Forge/ForgeDiT.swift:44 — Report.rows has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 9 (11 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 · MainWindow.watchKeys (cognitive 27) · ×1
  • MainWindow.watchKeys (cognitive 27) Sources/SiliconedApp/App.swift:546 — MainWindow.watchKeys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MeasureOptions.parse (cognitive 26) · ×1
  • MeasureOptions.parse (cognitive 26) Sources/Measurement/Series.swift:29 — MeasureOptions.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). Of this number, 23 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Recipe.init (cognitive 26) · ×1
  • Recipe.init (cognitive 26) Sources/Siliconed/Engine.swift:231 — Recipe.init has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 6, loops 1 (2 pts) (nesting depth added 6). Of this number, 24 points are the body's own statements and 2 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 · MemoryPlan.choose (cognitive 26) · ×1
  • MemoryPlan.choose (cognitive 26) Sources/Siliconed/MemoryPlan.swift:124 — MemoryPlan.choose has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts), ternaries 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Config.init (cognitive 26) · ×1
  • Config.init (cognitive 26) Sources/Siliconed/Qwen35.swift:74 — Config.init has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · HubImport.examine (cognitive 26) · ×1
  • HubImport.examine (cognitive 26) Sources/Siliconed/Forge/HubLink.swift:206 — HubImport.examine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 4 (6 pts), boolean chains 5, ternaries 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · RemoteChannel.receive (cognitive 26) · ×1
  • RemoteChannel.receive (cognitive 26) Sources/Siliconed/Remote/Channel.swift:136 — RemoteChannel.receive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MirrorServer.handle (cognitive 26) · ×1
  • MirrorServer.handle (cognitive 26) Sources/SiliconedApp/MirrorServer.swift:172 — MirrorServer.handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 4 (8 pts), boolean chains 2, match/switch 1 (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 · RemoteControl.uninstall (cognitive 26) · ×1
  • RemoteControl.uninstall (cognitive 26) Sources/SiliconedApp/RemoteControl+Gestures.swift:357 — RemoteControl.uninstall has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 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 · AnimaConditioner.condition (cognitive 25) · ×1
  • AnimaConditioner.condition (cognitive 25) Sources/Siliconed/AnimaConditioner.swift:221 — AnimaConditioner.condition has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 7 (9 pts), boolean chains 3 (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.
D2 · Cognitive Complexity · CapacityFit.shapedLine (cognitive 25) · ×1
  • CapacityFit.shapedLine (cognitive 25) Sources/Siliconed/CapacityFit.swift:397 — CapacityFit.shapedLine has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 1 (3 pts), match/switch 1 (nesting depth added 7). Of this number, 18 points are the body's own statements and 7 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 · Diagnostic.exactRows (cognitive 25) · ×1
  • Diagnostic.exactRows (cognitive 25) Sources/Siliconed/DiagnosticProbes.swift:133 — Diagnostic.exactRows has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (22 pts), ternaries 1 (2 pts), if/else 1 (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 · Krea2DiT.blockStreamed (cognitive 25) · ×1
  • Krea2DiT.blockStreamed (cognitive 25) Sources/Siliconed/Krea2.swift:451 — Krea2DiT.blockStreamed has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 9, ternaries 3 (5 pts) (nesting depth added 2). Of this number, 22 points are the body's own statements and 3 belong to 2 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, 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 · Widen.rotateTile (cognitive 25) · ×1
  • Widen.rotateTile (cognitive 25) Sources/Siliconed/Widen.swift:499 — Widen.rotateTile has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · QuantizedTensor.absMax (cognitive 25) · ×1
  • QuantizedTensor.absMax (cognitive 25) Sources/Siliconed/Forge/Quantization.swift:175 — QuantizedTensor.absMax has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · MirrorLibraryHost.handle (cognitive 25) · ×1
  • MirrorLibraryHost.handle (cognitive 25) Sources/SiliconedApp/MirrorLibrary.swift:390 — MirrorLibraryHost.handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, match/switch 1 (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 · ForgeProgress.line (cognitive 25) · ×1
  • ForgeProgress.line (cognitive 25) Sources/SiliconedApp/Problems.swift:358 — ForgeProgress.line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 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.
D2 · Cognitive Complexity · RemoteControl.set (cognitive 25) · ×1
  • RemoteControl.set (cognitive 25) Sources/SiliconedApp/RemoteControl+Commands.swift:279 — RemoteControl.set has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, match/switch 3 (4 pts) (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.
D2 · Cognitive Complexity · RemoteControl.followGrid (cognitive 25) · ×1
  • RemoteControl.followGrid (cognitive 25) Sources/SiliconedApp/RemoteControl+Follow.swift:13 — RemoteControl.followGrid has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). Of this number, 23 points are the body's own statements and 2 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 · GEMM.accumulatedLinear (cognitive 24) · ×1
  • GEMM.accumulatedLinear (cognitive 24) Sources/Siliconed/GEMM.swift:523 — GEMM.accumulatedLinear has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · LoRA.materialize (cognitive 24) · ×1
  • LoRA.materialize (cognitive 24) Sources/Siliconed/LoRA.swift:173 — LoRA.materialize has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 6 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · MemoryNeed.gemm (cognitive 24) · ×1
  • MemoryNeed.gemm (cognitive 24) Sources/Siliconed/MemoryNeed.swift:416 — MemoryNeed.gemm has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (10 pts), ternaries 3, boolean chains 1 (nesting depth added 7). Of this number, 14 points are the body's own statements and 10 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 · PromptAlternatives.parse (cognitive 24) · ×1
  • PromptAlternatives.parse (cognitive 24) Sources/Siliconed/PromptAlternatives.swift:197 — PromptAlternatives.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Qwen35Encoder.encode (cognitive 24) · ×1
  • Qwen35Encoder.encode (cognitive 24) Sources/Siliconed/Qwen35.swift:462 — Qwen35Encoder.encode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (7 pts), ternaries 1 (2 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 · Qwen3VLEncoder.encode (cognitive 24) · ×1
  • Qwen3VLEncoder.encode (cognitive 24) Sources/Siliconed/Qwen3VL.swift:102 — Qwen3VLEncoder.encode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (11 pts) (nesting depth added 10). Of this number, 14 points are the body's own statements and 10 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 · Resample.lanczosDouble (cognitive 24) · ×1
  • Resample.lanczosDouble (cognitive 24) Sources/Siliconed/Resample.swift:154 — Resample.lanczosDouble has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (22 pts), if/else 2 (nesting depth added 14). Of this number, 22 points are the body's own statements and 2 belong to one function item 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.
D2 · Cognitive Complexity · WorkingCopy.prepare (cognitive 24) · ×1
  • WorkingCopy.prepare (cognitive 24) Sources/Siliconed/WorkingCopy.swift:137 — WorkingCopy.prepare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (10 pts), ternaries 1 (2 pts), boolean chains 1, 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 · Downloader.download (cognitive 24) · ×1
  • Downloader.download (cognitive 24) Sources/Siliconed/Forge/Downloader.swift:97 — Downloader.download has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2 (4 pts), error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteHost.pair (cognitive 24) · ×1
  • RemoteHost.pair (cognitive 24) Sources/Siliconed/Remote/Host.swift:321 — RemoteHost.pair has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, ternaries 2 (5 pts), error handling 1 (2 pts), match/switch 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 · AppState.sheetDrawing (cognitive 24) · ×1
  • AppState.sheetDrawing (cognitive 24) Sources/SiliconedApp/AppState+Render.swift:211 — AppState.sheetDrawing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, boolean chains 4, ternaries 3, loops 1, match/switch 1. Of this number, 20 points are the body's own statements and 4 belong to 3 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 · RemoteControl.writeInText (cognitive 24) · ×1
  • RemoteControl.writeInText (cognitive 24) Sources/SiliconedApp/RemoteControl+Lab.swift:82 — RemoteControl.writeInText has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, match/switch 1 (2 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · RemoteControl.followMirroredGrid (cognitive 24) · ×1
  • RemoteControl.followMirroredGrid (cognitive 24) Sources/SiliconedApp/RemoteControl+Mirror.swift:337 — RemoteControl.followMirroredGrid has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 3). Of this number, 14 points are the body's own statements and 10 belong to 2 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, 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 · CapacityFit.sharing (cognitive 23) · ×1
  • CapacityFit.sharing (cognitive 23) Sources/Siliconed/CapacityFit.swift:272 — CapacityFit.sharing has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CapacityModel.init (cognitive 23) · ×1
  • CapacityModel.init (cognitive 23) Sources/Siliconed/CapacityModel.swift:368 — CapacityModel.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (8 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 · CapacityPlan.init (cognitive 23) · ×1
  • CapacityPlan.init (cognitive 23) Sources/Siliconed/CapacityPlan.swift:191 — CapacityPlan.init has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, ternaries 3. Of this number, 22 points are the body's own statements and 1 belongs to one function item 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.
D2 · Cognitive Complexity · EngineSettings.init (cognitive 23) · ×1
  • EngineSettings.init (cognitive 23) Sources/Siliconed/EngineSettings.swift:256 — EngineSettings.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 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 · VAEEncoder.init (cognitive 23) · ×1
  • VAEEncoder.init (cognitive 23) Sources/Siliconed/VAEEncoder.swift:113 — VAEEncoder.init has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 2, match/switch 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 · RemoteHost.admit (cognitive 23) · ×1
  • RemoteHost.admit (cognitive 23) Sources/Siliconed/Remote/Host.swift:194 — RemoteHost.admit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 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 · AppState.open (cognitive 23) · ×1
  • AppState.open (cognitive 23) Sources/SiliconedApp/AppState+Hub.swift:34 — AppState.open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, error handling 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SceneView.bar (cognitive 23) · ×1
  • SceneView.bar (cognitive 23) Sources/SiliconedApp/SceneView.swift:171 — SceneView.bar has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 5 (8 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 · main.swift.top-level code (cognitive 23) · ×1
  • main.swift.top-level code (cognitive 23) Sources/Silicontrol/main.swift:21 — main.swift.top-level code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 4 (8 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AnimaDiT.gemv (cognitive 22) · ×1
  • AnimaDiT.gemv (cognitive 22) Sources/Siliconed/Anima.swift:641 — AnimaDiT.gemv has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (16 pts), boolean chains 3, if/else 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · FileCopy.copy (cognitive 22) · ×1
  • FileCopy.copy (cognitive 22) Sources/Siliconed/LibraryPlace.swift:298 — FileCopy.copy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImage21DiT.layerStreamed (cognitive 22) · ×1
  • QwenImage21DiT.layerStreamed (cognitive 22) Sources/Siliconed/QwenImage21.swift:739 — QwenImage21DiT.layerStreamed has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, loops 5 (6 pts), if/else 5, ternaries 3 (nesting depth added 1). Of this number, 21 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImage21DiT.attend (cognitive 22) · ×1
  • QwenImage21DiT.attend (cognitive 22) Sources/Siliconed/QwenImage21.swift:1032 — QwenImage21DiT.attend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetOrder.parse (cognitive 22) · ×1
  • SetOrder.parse (cognitive 22) Sources/Siliconed/RemoteWriting.swift:228 — SetOrder.parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · T5Tokenizer.viterbi (cognitive 22) · ×1
  • T5Tokenizer.viterbi (cognitive 22) Sources/Siliconed/T5Tokenizer.swift:154 — T5Tokenizer.viterbi has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TiledAttention.submit (cognitive 22) · ×1
  • TiledAttention.submit (cognitive 22) Sources/Siliconed/TiledAttention.swift:240 — TiledAttention.submit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 5, loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WeightProducts.prepareSQ (cognitive 22) · ×1
  • WeightProducts.prepareSQ (cognitive 22) Sources/Siliconed/WeightProducts.swift:961 — WeightProducts.prepareSQ has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Widen.dequantizePacked (cognitive 22) · ×1
  • Widen.dequantizePacked (cognitive 22) Sources/Siliconed/Widen.swift:623 — Widen.dequantizePacked has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 4, boolean chains 1, match/switch 1 (nesting depth added 8). Of this number, 20 points are the body's own statements and 2 belong to one function item 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.
D2 · Cognitive Complexity · ForgeQwen35.plan (cognitive 22) · ×1
  • ForgeQwen35.plan (cognitive 22) Sources/Siliconed/Forge/ForgeQwen35.swift:49 — ForgeQwen35.plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Parser.chain (cognitive 22) · ×1
  • Parser.chain (cognitive 22) Sources/Siliconed/Forge/OrderedJSON.swift:187 — Parser.chain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QuantizedTensor.dequantized (cognitive 22) · ×1
  • QuantizedTensor.dequantized (cognitive 22) Sources/Siliconed/Forge/Quantization.swift:52 — QuantizedTensor.dequantized has cognitive complexity 22 (threshold 15). Drivers by points: loops 3 (9 pts), boolean chains 5, if/else 4, ternaries 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 · Problem.sentence (cognitive 22) · ×1
  • Problem.sentence (cognitive 22) Sources/SiliconedApp/Problems.swift:56 — Problem.sentence has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 10). 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 · Footer.body (cognitive 22) · ×1
  • Footer.body (cognitive 22) Sources/SiliconedApp/Sidebar.swift:124 — Footer.body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 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 · FrameEditor.drag (cognitive 22) · ×1
  • FrameEditor.drag (cognitive 22) Sources/SiliconedApp/SubjectSheet.swift:335 — FrameEditor.drag has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · AnimaOps.patchify (cognitive 21) · ×1
  • AnimaOps.patchify (cognitive 21) Sources/Siliconed/Anima.swift:879 — AnimaOps.patchify has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), ternaries 1 (6 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.
D2 · Cognitive Complexity · Artifact.scale (cognitive 21) · ×1
  • Artifact.scale (cognitive 21) Sources/Siliconed/Artifact.swift:370 — Artifact.scale has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 4, match/switch 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Phase.init (cognitive 21) · ×1
  • Phase.init (cognitive 21) Sources/Siliconed/Remote/Installing.swift:176 — Phase.init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Admission.judge (cognitive 21) · ×1
  • Admission.judge (cognitive 21) Sources/Siliconed/EngineAdmission.swift:30 — Admission.judge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EngineError.errorDescription (cognitive 21) · ×1
  • EngineError.errorDescription (cognitive 21) Sources/Siliconed/Errors.swift:276 — EngineError.errorDescription has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (13 pts), ternaries 3 (6 pts), boolean chains 1, if/else 1 (nesting depth added 9). 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 · Qwen3VLDecoder.make · ×1
  • Qwen3VLDecoder.make::matrix (cognitive 21) Sources/Siliconed/Qwen3VLDecoder.swift:424 — Qwen3VLDecoder.make::matrix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImage21DiT.init (cognitive 21) · ×1
  • QwenImage21DiT.init (cognitive 21) Sources/Siliconed/QwenImage21.swift:292 — QwenImage21DiT.init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2, 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 · QwenImage21VAEDecoder.decode (cognitive 21) · ×1
  • QwenImage21VAEDecoder.decode (cognitive 21) Sources/Siliconed/QwenImage21VAE.swift:523 — QwenImage21VAEDecoder.decode has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · Tokenizer.split (cognitive 21) · ×1
  • Tokenizer.split (cognitive 21) Sources/Siliconed/Tokenizer.swift:330 — Tokenizer.split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AppState.enqueueGrid (cognitive 21) · ×1
  • AppState.enqueueGrid (cognitive 21) Sources/SiliconedApp/AppState+Render.swift:76 — AppState.enqueueGrid has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, ternaries 4 (5 pts), boolean chains 4, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · MirrorServer.release (cognitive 21) · ×1
  • MirrorServer.release (cognitive 21) Sources/SiliconedApp/MirrorServer.swift:249 — MirrorServer.release has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (6 pts), ternaries 1 (5 pts), error handling 2 (4 pts), loops 2 (3 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.
D2 · Cognitive Complexity · RemoteControl.followToEnd (cognitive 21) · ×1
  • RemoteControl.followToEnd (cognitive 21) Sources/SiliconedApp/RemoteControl+Follow.swift:124 — RemoteControl.followToEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SceneView.body (cognitive 21) · ×1
  • SceneView.body (cognitive 21) Sources/SiliconedApp/SceneView.swift:32 — SceneView.body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · CheckCommand.run (cognitive 21) · ×1
  • CheckCommand.run (cognitive 21) Sources/Verification/Registry.swift:25 — CheckCommand.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 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 · AnimaConditioner.attention (cognitive 20) · ×1
  • AnimaConditioner.attention (cognitive 20) Sources/Siliconed/AnimaConditioner.swift:176 — AnimaConditioner.attention has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (20 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · PromptDiff.align (cognitive 20) · ×1
  • PromptDiff.align (cognitive 20) Sources/Siliconed/PromptDiff.swift:109 — PromptDiff.align has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 6 (7 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Qwen3VLVision.encode (cognitive 20) · ×1
  • Qwen3VLVision.encode (cognitive 20) Sources/Siliconed/Qwen3VLVision.swift:264 — Qwen3VLVision.encode has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TiledAttention.init (cognitive 20) · ×1
  • TiledAttention.init (cognitive 20) Sources/Siliconed/TiledAttention.swift:118 — TiledAttention.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 4 (5 pts), boolean chains 4 (nesting depth added 2). Of this number, 18 points are the body's own statements and 2 belong to 2 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, 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 · ForgeText.plan (cognitive 20) · ×1
  • ForgeText.plan (cognitive 20) Sources/Siliconed/Forge/ForgeText.swift:71 — ForgeText.plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 6 (8 pts), boolean chains 7, 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. This shape REPEATS in the file: one other method here (ForgeText.plan::wantedName) 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 · AppCommands.body (cognitive 20) · ×1
  • AppCommands.body (cognitive 20) Sources/SiliconedApp/App.swift:53 — AppCommands.body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, ternaries 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · AppState.next (cognitive 20) · ×1
  • AppState.next (cognitive 20) Sources/SiliconedApp/AppState+Render.swift:279 — AppState.next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 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, 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 · RemoteControl.lab (cognitive 20) · ×1
  • RemoteControl.lab (cognitive 20) Sources/SiliconedApp/RemoteControl+Lab.swift:21 — RemoteControl.lab has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). Of this number, 19 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProductAssignment.route (cognitive 19) · ×1
  • ProductAssignment.route (cognitive 19) Sources/Siliconed/CapacityPlan.swift:554 — ProductAssignment.route has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 9). 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 · Diagnostic.measureWidening (cognitive 19) · ×1
  • Diagnostic.measureWidening (cognitive 19) Sources/Siliconed/DiagnosticWideningProbes.swift:28 — Diagnostic.measureWidening has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (8 pts), loops 6 (7 pts), if/else 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 16 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MossImageDiT.forward (cognitive 19) · ×1
  • MossImageDiT.forward (cognitive 19) Sources/Siliconed/MossImage.swift:261 — MossImageDiT.forward has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 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 · UTF8Stream.incompleteTail (cognitive 19) · ×1
  • UTF8Stream.incompleteTail (cognitive 19) Sources/Siliconed/Qwen3VLGeneration.swift:658 — UTF8Stream.incompleteTail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TokenizerJSON.skipValue (cognitive 19) · ×1
  • TokenizerJSON.skipValue (cognitive 19) Sources/Siliconed/TokenizerTables.swift:146 — TokenizerJSON.skipValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WeightProducts.classification (cognitive 19) · ×1
  • WeightProducts.classification (cognitive 19) Sources/Siliconed/WeightProducts.swift:479 — WeightProducts.classification has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). 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 · ForgeText.plan · ×1
  • ForgeText.plan::wantedName (cognitive 19) Sources/Siliconed/Forge/ForgeText.swift:93 — ForgeText.plan::wantedName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ForgeText.plan) 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 · HubImport.contentRanges (cognitive 19) · ×1
  • HubImport.contentRanges (cognitive 19) Sources/Siliconed/Forge/HubLink.swift:259 — HubImport.contentRanges has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (7 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Installer.installMossImage (cognitive 19) · ×1
  • Installer.installMossImage (cognitive 19) Sources/Siliconed/Forge/Installation.swift:682 — Installer.installMossImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (8 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 · OrderedJSON.reprPython (cognitive 19) · ×1
  • OrderedJSON.reprPython (cognitive 19) Sources/Siliconed/Forge/OrderedJSON.swift:32 — OrderedJSON.reprPython has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 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 · RemotePairingAttempt.start (cognitive 19) · ×1
  • RemotePairingAttempt.start (cognitive 19) Sources/Siliconed/Remote/Link.swift:211 — RemotePairingAttempt.start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 1, match/switch 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 · AppState.formBlocker (cognitive 19) · ×1
  • AppState.formBlocker (cognitive 19) Sources/SiliconedApp/AppState+Catalog.swift:73 — AppState.formBlocker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · LicenseTerms.body (cognitive 19) · ×1
  • LicenseTerms.body (cognitive 19) Sources/SiliconedApp/LicenseSheet.swift:29 — LicenseTerms.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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 · Coordinator.restyle (cognitive 19) · ×1
  • Coordinator.restyle (cognitive 19) Sources/SiliconedApp/PromptField.swift:207 — Coordinator.restyle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Coordinator.typedMention (cognitive 19) · ×1
  • Coordinator.typedMention (cognitive 19) Sources/SiliconedApp/PromptField.swift:271 — Coordinator.typedMention has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, ternaries 1 (3 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 · PromptTextView.varyTarget (cognitive 19) · ×1
  • PromptTextView.varyTarget (cognitive 19) Sources/SiliconedApp/PromptField.swift:378 — PromptTextView.varyTarget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · AnimaDiT.block (cognitive 18) · ×1
  • AnimaDiT.block (cognitive 18) Sources/Siliconed/Anima.swift:288 — AnimaDiT.block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HeadSplitAttention.run (cognitive 18) · ×1
  • HeadSplitAttention.run (cognitive 18) Sources/Siliconed/HeadSplitAttention.swift:389 — HeadSplitAttention.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · PromptDiff.pieces (cognitive 18) · ×1
  • PromptDiff.pieces (cognitive 18) Sources/Siliconed/PromptDiff.swift:31 — PromptDiff.pieces has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 5, loops 5, if/else 4, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). Of this number, 14 points are the body's own statements and 4 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 · WriterOrder.parse (cognitive 18) · ×1
  • WriterOrder.parse (cognitive 18) Sources/Siliconed/RemoteWriting.swift:93 — WriterOrder.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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 · SolverWalk.stepUniPC (cognitive 18) · ×1
  • SolverWalk.stepUniPC (cognitive 18) Sources/Siliconed/Solver.swift:210 — SolverWalk.stepUniPC has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (9 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StreamedLoRA.init (cognitive 18) · ×1
  • StreamedLoRA.init (cognitive 18) Sources/Siliconed/StreamedLoRA.swift:31 — StreamedLoRA.init has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), loops 4 (5 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 · W8A8.quantize (cognitive 18) · ×1
  • W8A8.quantize (cognitive 18) Sources/Siliconed/TensorGEMMInt8.swift:198 — W8A8.quantize has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · WeightProducts.plannedInt8 (cognitive 18) · ×1
  • WeightProducts.plannedInt8 (cognitive 18) Sources/Siliconed/WeightProducts.swift:812 — WeightProducts.plannedInt8 has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 6, if/else 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 · Downloader.downloadInChunks (cognitive 18) · ×1
  • Downloader.downloadInChunks (cognitive 18) Sources/Siliconed/Forge/Downloader.swift:205 — Downloader.downloadInChunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ChunkRun.fetch (cognitive 18) · ×1
  • ChunkRun.fetch (cognitive 18) Sources/Siliconed/Forge/Downloader.swift:347 — ChunkRun.fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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 · AppState.receiveLibrary (cognitive 18) · ×1
  • AppState.receiveLibrary (cognitive 18) Sources/SiliconedApp/MirrorLibrary.swift:80 — AppState.receiveLibrary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 6). 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 · MenuEntry.body (cognitive 18) · ×1
  • MenuEntry.body (cognitive 18) Sources/SiliconedApp/HistoryTiles.swift:257 — MenuEntry.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MirrorServer.admit (cognitive 18) · ×1
  • MirrorServer.admit (cognitive 18) Sources/SiliconedApp/MirrorServer.swift:327 — MirrorServer.admit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, 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 · Wires.body (cognitive 18) · ×1
  • Wires.body (cognitive 18) Sources/SiliconedApp/Rack.swift:99 — Wires.body has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Statistics.stages (cognitive 18) · ×1
  • Statistics.stages (cognitive 18) Sources/SiliconedApp/Statistics.swift:62 — Statistics.stages has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · QwenImageStages.textWithImages (cognitive 18) · ×1
  • QwenImageStages.textWithImages (cognitive 18) Sources/Verification/QwenImageStages.swift:86 — QwenImageStages.textWithImages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 2). Of this number, 11 points are the body's own statements and 7 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 · Context.chooseTiles · ×1
  • Context.chooseTiles::run (cognitive 17) Sources/Siliconed/CapacityProbesSolos.swift:114 — Context.chooseTiles::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 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 · CapacityFit.thinFit (cognitive 17) · ×1
  • CapacityFit.thinFit (cognitive 17) Sources/Siliconed/CapacityFit.swift:460 — CapacityFit.thinFit has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. Of this number, 16 points are the body's own statements and 1 belongs to one function item 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.
D2 · Cognitive Complexity · Flux2VAE.patchify (cognitive 17) · ×1
  • Flux2VAE.patchify (cognitive 17) Sources/Siliconed/Flux2VAE.swift:128 — Flux2VAE.patchify has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TileTable.use (cognitive 17) · ×1
  • TileTable.use (cognitive 17) Sources/Siliconed/MatmulTile.swift:333 — TileTable.use has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NamedSubjects.mentions (cognitive 17) · ×1
  • NamedSubjects.mentions (cognitive 17) Sources/Siliconed/NamedSubjects.swift:163 — NamedSubjects.mentions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NeuralEngine.prepareColumns (cognitive 17) · ×1
  • NeuralEngine.prepareColumns (cognitive 17) Sources/Siliconed/NeuralEngine.swift:523 — NeuralEngine.prepareColumns has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · TailStream.start (cognitive 17) · ×1
  • TailStream.start (cognitive 17) Sources/Siliconed/Prefetcher.swift:348 — TailStream.start has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · PromptDiff.units (cognitive 17) · ×1
  • PromptDiff.units (cognitive 17) Sources/Siliconed/PromptDiff.swift:66 — PromptDiff.units has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 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 · QwenImage21VAEEncoder.stages (cognitive 17) · ×1
  • QwenImage21VAEEncoder.stages (cognitive 17) Sources/Siliconed/QwenImage21VAE.swift:793 — QwenImage21VAEEncoder.stages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VAELayout.place · ×1
  • VAELayout.place::layout (cognitive 17) Sources/Siliconed/VAEMemory.swift:163 — VAELayout.place::layout has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · WeightProducts.inPlaceInt8 (cognitive 17) · ×1
  • WeightProducts.inPlaceInt8 (cognitive 17) Sources/Siliconed/WeightProducts.swift:845 — WeightProducts.inPlaceInt8 has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 16, if/else 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 · Clouds.arbitrate (cognitive 17) · ×1
  • Clouds.arbitrate (cognitive 17) Sources/Verification/Krea2Stages.swift:428 — Clouds.arbitrate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 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.
D2 · Cognitive Complexity · Context.sharingPair (cognitive 16) · ×1
  • Context.sharingPair (cognitive 16) Sources/Siliconed/CapacityProbesSharing.swift:41 — Context.sharingPair has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, loops 1, match/switch 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 · Context.normRope (cognitive 16) · ×1
  • Context.normRope (cognitive 16) Sources/Siliconed/CapacityProbesWake.swift:84 — Context.normRope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, 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 · Block.forward (cognitive 16) · ×1
  • Block.forward (cognitive 16) Sources/Siliconed/Block.swift:382 — Block.forward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ProductSolver.candidates (cognitive 16) · ×1
  • ProductSolver.candidates (cognitive 16) Sources/Siliconed/CapacitySolver.swift:536 — ProductSolver.candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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 · Krea2Exact.linears (cognitive 16) · ×1
  • Krea2Exact.linears (cognitive 16) Sources/Siliconed/Krea2.swift:1009 — Krea2Exact.linears has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4, boolean chains 3 (nesting depth added 4). Of this number, 10 points are the body's own statements and 6 belong to one function item 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.
D2 · Cognitive Complexity · TailStream.pointer (cognitive 16) · ×1
  • TailStream.pointer (cognitive 16) Sources/Siliconed/Prefetcher.swift:399 — TailStream.pointer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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 · PromptWriter.run (cognitive 16) · ×1
  • PromptWriter.run (cognitive 16) Sources/Siliconed/PromptWriter.swift:198 — PromptWriter.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 1, error handling 1, match/switch 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · QKNormRope.run (cognitive 16) · ×1
  • QKNormRope.run (cognitive 16) Sources/Siliconed/QKNormRope.swift:174 — QKNormRope.run has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Config.init (cognitive 16) · ×1
  • Config.init (cognitive 16) Sources/Siliconed/Qwen3VLVision.swift:60 — Config.init has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · CropSpec.resolve (cognitive 16) · ×1
  • CropSpec.resolve (cognitive 16) Sources/Siliconed/RemoteGestures.swift:38 — CropSpec.resolve has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), match/switch 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 · Widen.dequantize (cognitive 16) · ×1
  • Widen.dequantize (cognitive 16) Sources/Siliconed/Widen.swift:129 — Widen.dequantize has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4, match/switch 2, boolean chains 1 (nesting depth added 5). Of this number, 14 points are the body's own statements and 2 belong to one function item 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.
D2 · Cognitive Complexity · MapWriter.produce (cognitive 16) · ×1
  • MapWriter.produce (cognitive 16) Sources/Siliconed/Forge/Map.swift:434 — MapWriter.produce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 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 · MainWindow.key (cognitive 16) · ×1
  • MainWindow.key (cognitive 16) Sources/SiliconedApp/App.swift:594 — MainWindow.key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 5). 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 · AppState.click (cognitive 16) · ×1
  • AppState.click (cognitive 16) Sources/SiliconedApp/AppState+History.swift:75 — AppState.click has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LabModel.writeForRemote (cognitive 16) · ×1
  • LabModel.writeForRemote (cognitive 16) Sources/SiliconedApp/LabRemote.swift:43 — LabModel.writeForRemote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ModelManagement.installPanel (cognitive 16) · ×1
  • ModelManagement.installPanel (cognitive 16) Sources/SiliconedApp/ModelsSheet.swift:183 — ModelManagement.installPanel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoteControl.install (cognitive 16) · ×1
  • RemoteControl.install (cognitive 16) Sources/SiliconedApp/RemoteControl+Commands.swift:19 — RemoteControl.install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, 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 · main.swift.exchange (cognitive 16) · ×1
  • main.swift.exchange (cognitive 16) Sources/Silicontrol/main.swift:70 — main.swift.exchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). Of this number, 10 points are the body's own statements and 6 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 · MossImageEncoderStages.run (cognitive 16) · ×1
  • MossImageEncoderStages.run (cognitive 16) Sources/Verification/MossImageEncoderStages.swift:92 — MossImageEncoderStages.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (23 shared lines) · ×1
  • Near-duplicate member pair (23 shared lines) Sources/SiliconedApp/RemoteControl+Add.swift:381 — Sources/SiliconedApp/RemoteControl+Add.swift:381-476 | Sources/SiliconedApp/RemoteControl+Mirror.swift:257-333 — These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) Sources/Siliconed/AnimaGELU.swift:93 — Sources/Siliconed/AnimaGELU.swift:93-103 | Sources/Siliconed/ElementwiseGPUAnima.swift:191-207 | Sources/Siliconed/ElementwiseGPUMoss.swift:137-148 | Sources/Siliconed/ElementwiseGPUkrea2.swift:145-157 | Sources/Siliconed/ElementwiseGPUqwen.swift:153-163 | Sources/Siliconed/MossImage.swift:925-935 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Edited copy of a member (54 corresponding lines) · ×1
  • Edited copy of a member (54 corresponding lines) Sources/Siliconed/Krea2.swift:144 — Sources/Siliconed/Krea2.swift:144-205 | Sources/Siliconed/MossImage.swift:145-198 — These two members are one piece of code written twice and then edited apart: 54 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 (43 corresponding lines) · ×1
  • Edited copy of a member (43 corresponding lines) Sources/Siliconed/ModulesKrea2.swift:86 — Sources/Siliconed/ModulesKrea2.swift:86-128 | Sources/Siliconed/MossImageModules.swift:96-142 — These two members are one piece of code written twice and then edited apart: 43 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) Sources/Siliconed/Krea2.swift:1060 — Sources/Siliconed/Krea2.swift:1060-1081 | Sources/Siliconed/QwenImage21.swift:914-935 — 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 (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) Sources/Siliconed/DiagnosticJudgement.swift:39 — Sources/Siliconed/DiagnosticJudgement.swift:39-71 | Sources/Verification/Measures.swift:12-34 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 7+ corresponding lines) Sources/Siliconed/MemoryNeedKrea2.swift:288 — Sources/Siliconed/MemoryNeedKrea2.swift:288-294 | Sources/Siliconed/MemoryNeedKrea2.swift:354-360 | Sources/Siliconed/MemoryNeedMossImage.swift:36-44 | Sources/Siliconed/Qwen3VLGeneration.swift:223-229 | Sources/Siliconed/Qwen3VLVision.swift:199-206 | Sources/Siliconed/TextEncoder.swift:231-237 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 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 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 18+ corresponding lines) Sources/Siliconed/MossImage.swift:828 — Sources/Siliconed/MossImage.swift:828-846 | Sources/Siliconed/Ops.swift:160-177 | Sources/Siliconed/Qwen35.swift:238-255 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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, 13+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 13+ corresponding lines) Sources/Siliconed/Krea2.swift:66 — Sources/Siliconed/Krea2.swift:66-79 | Sources/Siliconed/MossImage.swift:60-72 | Sources/Siliconed/QwenImage21.swift:66-78 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 16+ corresponding lines) Sources/Siliconed/Anima.swift:879 — Sources/Siliconed/Anima.swift:879-896 | Sources/Siliconed/Krea2.swift:911-926 | Sources/Siliconed/Krea2.swift:929-944 | Sources/Siliconed/Ops.swift:258-275 | Sources/Siliconed/Ops.swift:294-311 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 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 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) Sources/Siliconed/Krea2.swift:1105 — Sources/Siliconed/Krea2.swift:1105-1116 | Sources/Siliconed/QwenImage21.swift:940-951 — These two members are one piece of code written twice and then edited apart: 12 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 (4 members, 6+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 6+ corresponding lines) Sources/Siliconed/Modules.swift:153 — Sources/Siliconed/Modules.swift:153-158 | Sources/Siliconed/ModulesAnima.swift:179-184 | Sources/Siliconed/MossImageModules.swift:165-171 | Sources/Siliconed/QwenImage21VAE.swift:848-854 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 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.
D4 · Code Duplication · Edited copies of one member (3 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 10+ corresponding lines) Sources/Measurement/Probes.swift:96 — Sources/Measurement/Probes.swift:96-105 | Sources/Siliconed/Arena.swift:198-207 | Sources/Siliconed/VAEMemory.swift:570-579 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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 (5 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 4+ corresponding lines) Sources/Siliconed/Anima.swift:518 — Sources/Siliconed/Anima.swift:518-522 | Sources/Siliconed/Krea2.swift:635-639 | Sources/Siliconed/MossImage.swift:590-593 | Sources/Siliconed/MossImage.swift:654-658 | Sources/Siliconed/QwenImage21.swift:994-1001 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 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 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 4+ corresponding lines) Sources/Siliconed/Instrumentation.swift:15 — Sources/Siliconed/Instrumentation.swift:15-18 | Sources/Siliconed/Qwen35.swift:357-360 | Sources/Siliconed/Qwen3VLVision.swift:208-211 | Sources/Siliconed/TextEncoder.swift:327-330 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 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.
D4 · Code Duplication · Edited copies of one member (4 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 3+ corresponding lines) Sources/Siliconed/DiT.swift:374 — Sources/Siliconed/DiT.swift:374-376 | Sources/Siliconed/Qwen35.swift:362-364 | Sources/Siliconed/Qwen3VLVision.swift:213-215 | Sources/Siliconed/TextEncoder.swift:332-334 — These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×1
  • Duplicated block (11–12 lines × 2) Sources/Siliconed/Flux2VAE.swift:187 — Sources/Siliconed/Flux2VAE.swift:187-198 | Sources/Siliconed/VAE.swift:171-181 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Flux2VAE.swift:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `bands` to `VAE.Bands` in one and `Bands` 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 (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:407 — Sources/SiliconedApp/RemoteControl+Add.swift:407-418 | Sources/SiliconedApp/RemoteControl+Mirror.swift:278-287 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SiliconedApp/RemoteControl+Add.swift:407` 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 (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) Sources/Siliconed/Krea2.swift:1063 — Sources/Siliconed/Krea2.swift:1063-1081 | Sources/Siliconed/QwenImage21.swift:917-935 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Krea2.swift:1063` 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. 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. The matched lines also register a scope-exit action (a `defer`-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead — before the caller uses what it releases — so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register.
D4 · Code Duplication · Duplicated block (8–10 lines × 2) · ×1
  • Duplicated block (8–10 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:165 — Sources/SiliconedApp/RemoteControl+Add.swift:165-174 | Sources/SiliconedApp/RemoteControl+Mirror.swift:101-108 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (6–8 lines × 3) · ×1
  • Duplicated block (6–8 lines × 3) Sources/Siliconed/Anima.swift:251 — Sources/Siliconed/Anima.swift:251-256 | Sources/Siliconed/DiT.swift:320-327 | Sources/Siliconed/Krea2.swift:310-315 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/Anima.swift:251` 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 (6–8 lines × 2) · ×1
  • Duplicated block (6–8 lines × 2) Sources/SiliconedApp/RemoteControl+Add.swift:385 — Sources/SiliconedApp/RemoteControl+Add.swift:385-392 | Sources/SiliconedApp/RemoteControl+Mirror.swift:261-266 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/SiliconedApp/RemoteControl+Add.swift:385` 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 (2–7 lines × 3) · ×1
  • Duplicated block (2–7 lines × 3) Sources/Siliconed/TensorGEMM.swift:354 — Sources/Siliconed/TensorGEMM.swift:354-355 | Sources/Siliconed/TensorGEMMBF16.swift:258-264 | Sources/Siliconed/TensorGEMMInt8.swift:274-280 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/TensorGEMM.swift:354` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. 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, `Sources/Siliconed/TensorGEMMBF16.swift:258` calls `dispatchThreads`, `MTLSize` and `Sources/Siliconed/TensorGEMM.swift:354` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (3–6 lines × 4) · ×1
  • Duplicated block (3–6 lines × 4) Sources/Siliconed/ElementwiseGPUAnima.swift:197 — Sources/Siliconed/ElementwiseGPUAnima.swift:197-202 | Sources/Siliconed/ElementwiseGPUMoss.swift:142-144 | Sources/Siliconed/ElementwiseGPUkrea2.swift:151-156 | Sources/Siliconed/ElementwiseGPUqwen.swift:157-160 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. 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, `Sources/Siliconed/ElementwiseGPUAnima.swift:197` calls `makeFunction` and `Sources/Siliconed/ElementwiseGPUMoss.swift:142` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (4–5 lines × 6) · ×1
  • Duplicated block (4–5 lines × 6) Sources/Siliconed/AnimaGELU.swift:93 — Sources/Siliconed/AnimaGELU.swift:93-97 | Sources/Siliconed/ElementwiseGPUAnima.swift:191-195 | Sources/Siliconed/ElementwiseGPUMoss.swift:137-141 | Sources/Siliconed/ElementwiseGPUkrea2.swift:145-149 | Sources/Siliconed/ElementwiseGPUqwen.swift:154-157 | Sources/Siliconed/MossImage.swift:925-929 — 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 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/AnimaGELU.swift:93` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Sources/Siliconed/ElementwiseGPUAnima.swift:195` calls `makeLibrary` and `Sources/Siliconed/ElementwiseGPUqwen.swift:157` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (2–5 lines × 3) · ×1
  • Duplicated block (2–5 lines × 3) Sources/Siliconed/Anima.swift:334 — Sources/Siliconed/Anima.swift:334-338 | Sources/Siliconed/Anima.swift:351-355 | Sources/Siliconed/Anima.swift:360-361 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) Sources/Siliconed/TensorGEMMBF16.swift:144 — Sources/Siliconed/TensorGEMMBF16.swift:144-148 | Sources/Siliconed/TensorGEMMInt8.swift:166-170 | Sources/Siliconed/TensorGEMMKQuant.swift:145-149 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Sources/Siliconed/TensorGEMMBF16.swift: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 · Edited copy of a member (26 corresponding lines) · ×1
  • Edited copy of a member (26 corresponding lines) tools/oracle/qwen-image-2.1.py:680 — tools/oracle/qwen-image-2.1.py:680-705 | tools/oracle/qwen-image-2.1.py:709-737 — These two members are one piece of code written twice and then edited apart: 26 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 (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) tools/oracle/anima.py:646 — tools/oracle/anima.py:646-679 | tools/oracle/moss-image.py:862-893 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 19+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 19+ corresponding lines) tools/oracle/anima.py:606 — tools/oracle/anima.py:606-624 | tools/oracle/krea2.py:951-969 | tools/oracle/qwen-image-2.1.py:990-1009 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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 (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) tools/oracle/anima.py:348 — tools/oracle/anima.py:348-363 | tools/oracle/anima.py:367-391 — These two members are one piece of code written twice and then edited apart: 16 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 (4 members, 2+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 2+ corresponding lines) tools/oracle/common.py:167 — tools/oracle/common.py:167-169 | tools/oracle/moss-image.py:408-409 | tools/oracle/quantized.py:320-321 | tools/oracle/qwen-image-2.1-writer.py:159-160 — 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.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) tools/oracle/quant_fixtures.py:1043 — tools/oracle/quant_fixtures.py:1043-1056 | tools/oracle/quant_fixtures.py:1271-1284 — 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 (7–9 lines × 2) · ×1
  • Duplicated block (7–9 lines × 2) tools/oracle/z-image.py:382 — tools/oracle/z-image.py:382-390 | tools/oracle/z-image.py:461-467 — 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 `tools/oracle/z-image.py:382` 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.
Minor — 25 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×14
  • Duplicated predicate tools/oracle/anima.py:661 — `args.stage == "w8a8" and args.variant != "compact"` appears character-identically in 5 files — tools/oracle/anima.py, tools/oracle/krea2.py, tools/oracle/moss-image.py, tools/oracle/qwen-image-2.1.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate tools/oracle/quant_fixtures.py:986 — `isinstance(n, ast.FunctionDef) and n.name in wanted` appears character-identically in 2 files — tools/oracle/quant_fixtures.py, tools/oracle/quantized.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate tools/oracle/anima.py:632 — `len(squares) < len(sizes) and "1024" not in squares` appears character-identically in 2 files — tools/oracle/anima.py, tools/oracle/krea2.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate tools/oracle/qwen-image-2.1-writer.py:88 — `t.is_meta and not name.startswith(streamed)` appears character-identically in 2 files — tools/oracle/qwen-image-2.1-writer.py, tools/oracle/qwen-image-2.1.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate Sources/SiliconedApp/AppState+Catalog.swift:281 — `!$0.path.isEmpty && !valid.contains($0.path)` appears character-identically in 2 files — Sources/SiliconedApp/AppState+Catalog.swift, Sources/SiliconedApp/AppState+Place.swift. 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 Sources/Siliconed/Krea2.swift:121 — `(a.usesTiles || a.splits) && sequence >= headSplitRows` appears character-identically in 2 files — Sources/Siliconed/Krea2.swift, Sources/Siliconed/MossImage.swift. 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 Sources/SiliconedApp/RemoteControl+Commands.swift:451 — `arguments.count == 1 || arguments[1] == "--download"` appears character-identically in 2 files — Sources/SiliconedApp/RemoteControl+Commands.swift, Sources/SiliconedApp/RemoteControl+Mirror.swift. 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 Sources/Siliconed/ElementwiseGPU.swift:443 — `columns % 2 == 0 && rounded.offset % 4 == 0` appears character-identically in 4 files — Sources/Siliconed/ElementwiseGPU.swift, Sources/Siliconed/ElementwiseGPUMoss.swift, Sources/Siliconed/ElementwiseGPUkrea2.swift, Sources/Siliconed/ElementwiseGPUqwen.swift. 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 Sources/Siliconed/MemoryNeedAnima.swift:159 — `image.width == width && image.height == height` appears character-identically in 4 files — Sources/Siliconed/MemoryNeedAnima.swift, Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedZImage.swift, Sources/Siliconed/Qwen3VLImages.swift. 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 Sources/Siliconed/CapacityPlan.swift:597 — `key.weight == .int8 || key.weight == .q8` appears character-identically in 2 files — Sources/Siliconed/CapacityPlan.swift, Sources/Siliconed/CapacitySolver.swift. 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 Sources/Siliconed/Modules.swift:100 — `lora != nil || context.detail != .normal` appears character-identically in 5 files — Sources/Siliconed/Modules.swift, Sources/Siliconed/ModulesAnima.swift, Sources/Siliconed/ModulesKrea2.swift, Sources/Siliconed/ModulesQwenImage21.swift. 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 Sources/Siliconed/Forge/ForgeQwen35.swift:122 — `outcome != .asNamed || t.dtype != .bfloat16` appears character-identically in 2 files — Sources/Siliconed/Forge/ForgeQwen35.swift, Sources/Siliconed/Forge/ForgeText.swift. 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 Sources/Siliconed/MemoryNeedAnima.swift:179 — `request.mapInPlace && request.mapInPlaceAvailable` appears character-identically in 5 files — Sources/Siliconed/MemoryNeedAnima.swift, Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedMossImage.swift, Sources/Siliconed/MemoryNeedQwenImage21.swift. 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 Sources/Siliconed/MemoryNeedKrea2.swift:212 — `request.tail.fraction > 0 && request.tail.streamed` appears character-identically in 2 files — Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedMossImage.swift. 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.
X7 · Silent fallback defaults · Silent fallback default in catch · ×3
  • Silent fallback default in catch Sources/Siliconed/LabInputs.swift:351 — `residue` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or let it propagate (`throws`). 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 at the `catch`, `guard` or `??`, or in the doc comment, and the row stops firing.
  • Silent fallback default in catch Sources/Siliconed/RenderCache.swift:278 — `evict` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or let it propagate (`throws`). 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 at the `catch`, `guard` or `??`, or in the doc comment, and the row stops firing.
  • Silent fallback default in catch Sources/SiliconedApp/AppState+Catalog.swift:219 — `promptGroups` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or let it propagate (`throws`). 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 at the `catch`, `guard` or `??`, or in the doc comment, and the row stops firing.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion Package.swift:1 — `(repository root)` (87601 LoC, 942 module-visible types across 11 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python, SwiftPM) overshoot their size bounds, lowering Project Cohesion to 0.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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:9 — No static application security testing detected. For this repository's stack, add CodeQL's Swift pack (Swift/Xcode) (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation REDACTED:8 — `REDACTED` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
Minor — 10 finding(s)
D12 · Dependency Hygiene · Outdated · ×10
  • Outdated: accelerate — `accelerate` is pinned to 1.15.0, but 1.16.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 1.15.0 until the declaration is edited.
  • Outdated: diffusers — `diffusers` is pinned to 0.41.0, but 0.43.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.41.0 until the declaration is edited.
  • Outdated: huggingface-hub — `huggingface-hub` is pinned to 1.33.0, but 2.4.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 1.33.0 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
  • Outdated: numpy — `numpy` is pinned to 2.5.3, but 2.5.5 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.5.3 until the declaration is edited.
  • Outdated: pillow — `pillow` is pinned to 12.3.0, but 13.0.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 12.3.0 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
  • Outdated: sdnq — `sdnq` is pinned to 0.2.7, but 0.2.9 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.2.7 until the declaration is edited.
  • Outdated: tokenizers — `tokenizers` is pinned to 0.23.2, but 0.23.3 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.23.2 until the declaration is edited.
  • Outdated: torch — `torch` is pinned to 2.14.1, but 2.15.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.14.1 until the declaration is edited.
  • Outdated: torchvision — `torchvision` is pinned to 0.29.1, but 0.29.2 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.29.1 until the declaration is edited.
  • Outdated: transformers — `transformers` is pinned to 5.19.0, but 5.23.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 5.19.0 until the declaration is edited.

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-c136ab57ddf34be7b2d0f43bfffa0da0/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=279" --report-format json --report-path /tmp/watchdog-gitleaks-c136ab57ddf34be7b2d0f43bfffa0da0/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.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-c136ab57ddf34be7b2d0f43bfffa0da0/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .8artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .2artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 216 file(s) — `Sources/Measurement/Probes.swift`, `Sources/Measurement/Runner.swift`, `Sources/Measurement/Series.swift`, `Sources/Siliconed/Anima.swift`, `Sources/Siliconed/AnimaConditioner.swift`, … (+211 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1e92e-10d2-741a-a3da-c4f927d53d4a · 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