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

krauthaufen/Adaptify

Measured 15 November 2026, 10:13 UTC, at code version ca055e8

CAI score 58out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey

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

A small codebase: 6,949 lines of product code in 1 project, tests not counted · Estimated rebuild effort: under 0.1 person-years · Weakest lens: Maturity, 44

Findings by how serious they are

17 critical 67 serious 24 minor

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

This survey was produced by

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

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

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

37of 37 dimensions measured by tools.
96of 108 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
37dimensions across 6 lenses, read from 6,949 lines of product code in 1 project.
Chapters

Executive summary

krauthaufen/Adaptify falls short of our standard for production because 13 files are no longer known to anyone active in the project and the project keeps no record of its design decisions. It scores 58 out of 100 and is rated Adequate, and 14 of its 17 critical findings are security problems in the build pipeline and in the packages it uses.

Maturity, at 44, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 13 points. Having someone learn and document the 13 files no active contributor knows comes next, worth about 10 points. Raising Maturity to 70 would lift the score to about 69.

Nine pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Five known security holes in the packages the code depends on can be used by attackers, and three parts of the code are no longer understood by anyone working on it. Having someone learn the forgotten files, pinning each tool to an exact version and updating the vulnerable packages would close these risks.

The product code is 6,949 lines, about €6,400 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.
Maturity 44 · counts for 46%Production Readiness 61 · counts for 25%Security and Compliance 75 · counts for 14%Code Health 76 · counts for 8%Performance 85 · counts for 4%Architecture 100 · counts for 2%

If Maturity rose from 44 to 70, the lowest score rated Strong, the score would rise from 58 to about 69.

Code composition: what the lines of code are
Supporting code 7%Tests 93%
New since the last survey: 6 findings

These 6 critical or serious findings weren't in the previous survey, on 31 October 2026.

  • Code Coverage · Low coverage: src/Adaptify.Compiler/Process.fs src/Adaptify.Compiler/Process.fs
  • Code Coverage · Low coverage: src/Adaptify.Compiler/Server.fs src/Adaptify.Compiler/Server.fs
  • Code Coverage · Low coverage: src/Adaptify.Compiler/Cache.fs src/Adaptify.Compiler/Cache.fs
  • Code Coverage · Low coverage: src/Adaptify.Compiler/ProjectInfo.fs src/Adaptify.Compiler/ProjectInfo.fs
  • Code Coverage · Low coverage: src/Adaptify.Compiler/CoreTypes.fs src/Adaptify.Compiler/CoreTypes.fs
  • Code Coverage · Low coverage: src/Adaptify.Compiler/Scope.fs src/Adaptify.Compiler/Scope.fs

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 1 finding

This critical or serious finding was in the previous survey, on 31 October 2026, and is gone from this one.

  • Code Duplication · Duplicated block (4–6 lines × 3) src/Adaptify.Compiler/Adaptor.fs
Rebuild cost: about €6,400 · Estimate
Cost to rebuild€2,100 to €11,000, for 35 to 111 hours of work, under 0.1 person-years for one engineer
Difficulty of the problemLow, 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.8 at a score of 58. 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.
SizeSmall: 6,949 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.

Top priorities

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

1
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Adaptify.MSBuild.fsproj.
Raises the score by about 13 points · Low effort · ADR Quality
2
Resolve the 13 Orphaned file finding(s) in Knowledge Freshness — start with Program.fs (2), Process.fs, Utilities.fs.
Raises the score by about 10 points · Medium effort · Knowledge Freshness
3
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with CoreInstances.fs, Adaptor.fs, Runner.fs.
Raises the score by about 3 points · Low effort · Knowledge Freshness

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 €6,400 to build again, under 0.1 person-years of work. Its weakest lens is Maturity, at 44 (Weak). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 13 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.1 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 1,550 lines over the last 90 days, which is about 6,286 lines a year. At that pace, the extra work comes to an estimated 0.7 to 4.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — 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 Adaptify.Compiler Compiler Adaptify.Core Core Adaptify.MSBuild MSBuild Adaptify.MSBuild->Adaptify.Compiler Library Library Library->Adaptify.Core LibraryCSharp LibraryCSharp Net10 Net10 Net10->Library Net10->LibraryCSharp Net8 Net8 Net8->Library Net8->LibraryCSharp Net9 Net9 Net9->Library Net9->LibraryCSharp NetFramework NetFramework NetFramework->Adaptify.Core adaptify adaptify adaptify->Adaptify.Compiler

Architecture: which parts of the code depend on which

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

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

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

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Aardvark.Compiler2 Adaptify3 Adaptify.Compiler4 Aardvark.Compiler.CacheFileModule5 Aardvark.Compiler.WarningModule6 Adaptify.Compiler.Adaptify7 Adaptify.Compiler.AdaptifyModeModule8 Adaptify.Compiler.AdaptiveTypes9 Adaptify.Compiler.AdaptiveTypes.AList10 Adaptify.Compiler.AdaptiveTypes.AMap11 Adaptify.Compiler.AdaptiveTypes.ASet12 Adaptify.Compiler.AdaptiveTypes.AVal13 Adaptify.Compiler.AdaptiveTypes.AbstractAdaptiveValue14 Adaptify.Compiler.AdaptiveTypes.AdaptiveObject15 Adaptify.Compiler.AdaptiveTypes.AdaptiveToken16 Adaptify.Compiler.AdaptiveTypes.Adaptor17 Adaptify.Compiler.AdaptiveTypes.CList18 Adaptify.Compiler.AdaptiveTypes.CMap19 Adaptify.Compiler.AdaptiveTypes.CSet20 Adaptify.Compiler.AdaptiveTypes.CVal21 Adaptify.Compiler.AdaptiveTypes.CValCustomEquality22 Adaptify.Compiler.AdaptiveTypes.ChangeableListArray23 Adaptify.Compiler.AdaptiveTypes.ChangeableListList24 Adaptify.Compiler.AdaptiveTypes.ChangeableModelList25 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListArray26 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListList27 Adaptify.Compiler.AdaptiveTypes.ChangeableModelMap28 Adaptify.Compiler.AdaptiveTypes.HashMap29 Adaptify.Compiler.AdaptiveTypes.HashSet30 Adaptify.Compiler.AdaptiveTypes.IndexList31 Adaptify.Compiler.AdaptiveTypes.Lazy32 Adaptify.Compiler.AdaptiveTypes.List33 Adaptify.Compiler.AdaptiveTypes.Object34 Adaptify.Compiler.AdaptiveTypes.Option35 Adaptify.Compiler.AdaptiveTypes.Transaction36 Adaptify.Compiler.AdaptorModule37 Adaptify.Compiler.Client38 Adaptify.Compiler.IPC39 Adaptify.FSharp.Core40 Adaptify.Compiler.Server
1 Aardvark.Compiler
2 Adaptify
3 Adaptify.Compiler
4 Aardvark.Compiler.CacheFileModule11
5 Aardvark.Compiler.WarningModule1
6 Adaptify.Compiler.Adaptify2
7 Adaptify.Compiler.AdaptifyModeModule2
8 Adaptify.Compiler.AdaptiveTypes3
9 Adaptify.Compiler.AdaptiveTypes.AList1
10 Adaptify.Compiler.AdaptiveTypes.AMap1
11 Adaptify.Compiler.AdaptiveTypes.ASet1
12 Adaptify.Compiler.AdaptiveTypes.AVal2
13 Adaptify.Compiler.AdaptiveTypes.AbstractAdaptiveValue1
14 Adaptify.Compiler.AdaptiveTypes.AdaptiveObject2
15 Adaptify.Compiler.AdaptiveTypes.AdaptiveToken1
16 Adaptify.Compiler.AdaptiveTypes.Adaptor2
17 Adaptify.Compiler.AdaptiveTypes.CList2
18 Adaptify.Compiler.AdaptiveTypes.CMap2
19 Adaptify.Compiler.AdaptiveTypes.CSet2
20 Adaptify.Compiler.AdaptiveTypes.CVal2
21 Adaptify.Compiler.AdaptiveTypes.CValCustomEquality2
22 Adaptify.Compiler.AdaptiveTypes.ChangeableListArray2
23 Adaptify.Compiler.AdaptiveTypes.ChangeableListList2
24 Adaptify.Compiler.AdaptiveTypes.ChangeableModelList2
25 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListArray2
26 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListList2
27 Adaptify.Compiler.AdaptiveTypes.ChangeableModelMap2
28 Adaptify.Compiler.AdaptiveTypes.HashMap1
29 Adaptify.Compiler.AdaptiveTypes.HashSet1
30 Adaptify.Compiler.AdaptiveTypes.IndexList1
31 Adaptify.Compiler.AdaptiveTypes.Lazy2
32 Adaptify.Compiler.AdaptiveTypes.List1
33 Adaptify.Compiler.AdaptiveTypes.Object1
34 Adaptify.Compiler.AdaptiveTypes.Option2
35 Adaptify.Compiler.AdaptiveTypes.Transaction2
36 Adaptify.Compiler.AdaptorModule6
37 Adaptify.Compiler.Client2
38 Adaptify.Compiler.IPC1
39 Adaptify.FSharp.Core5
40 Adaptify.Compiler.Server21
Uses a module listed above itPart of a loopThe module itself
1 Aardvark.Compiler2 Adaptify3 Adaptify.Compiler4 Aardvark.Compiler.CacheFileModule5 Aardvark.Compiler.WarningModule6 Adaptify.Compiler.Adaptify7 Adaptify.Compiler.AdaptifyModeModule8 Adaptify.Compiler.AdaptiveTypes9 Adaptify.Compiler.AdaptiveTypes.AList10 Adaptify.Compiler.AdaptiveTypes.AMap11 Adaptify.Compiler.AdaptiveTypes.ASet12 Adaptify.Compiler.AdaptiveTypes.AVal13 Adaptify.Compiler.AdaptiveTypes.AbstractAdaptiveValue14 Adaptify.Compiler.AdaptiveTypes.AdaptiveObject15 Adaptify.Compiler.AdaptiveTypes.AdaptiveToken16 Adaptify.Compiler.AdaptiveTypes.Adaptor17 Adaptify.Compiler.AdaptiveTypes.CList18 Adaptify.Compiler.AdaptiveTypes.CMap19 Adaptify.Compiler.AdaptiveTypes.CSet20 Adaptify.Compiler.AdaptiveTypes.CVal21 Adaptify.Compiler.AdaptiveTypes.CValCustomEquality22 Adaptify.Compiler.AdaptiveTypes.ChangeableListArray23 Adaptify.Compiler.AdaptiveTypes.ChangeableListList24 Adaptify.Compiler.AdaptiveTypes.ChangeableModelList25 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListArray26 Adaptify.Compiler.AdaptiveTypes.ChangeableModelListList27 Adaptify.Compiler.AdaptiveTypes.ChangeableModelMap28 Adaptify.Compiler.AdaptiveTypes.HashMap29 Adaptify.Compiler.AdaptiveTypes.HashSet30 Adaptify.Compiler.AdaptiveTypes.IndexList31 Adaptify.Compiler.AdaptiveTypes.Lazy32 Adaptify.Compiler.AdaptiveTypes.List33 Adaptify.Compiler.AdaptiveTypes.Object34 Adaptify.Compiler.AdaptiveTypes.Option35 Adaptify.Compiler.AdaptiveTypes.Transaction36 Adaptify.Compiler.AdaptorModule37 Adaptify.Compiler.Client38 Adaptify.Compiler.IPC39 Adaptify.FSharp.Core40 Adaptify.Compiler.ServerAardvark.Compiler1Adaptify2Adaptify.Compiler3Aardvark.Compiler.CacheFileModule4Aardvark.Compiler.WarningModule5Adaptify.Compiler.Adaptify6Adaptify.Compiler.AdaptifyModeModule7Adaptify.Compiler.AdaptiveTypes8Adaptify.Compiler.AdaptiveTypes.AList9Adaptify.Compiler.AdaptiveTypes.AMap10Adaptify.Compiler.AdaptiveTypes.ASet11Adaptify.Compiler.AdaptiveTypes.AVal12Adaptify.Compiler.AdaptiveTypes.AbstractAdaptiveValue13Adaptify.Compiler.AdaptiveTypes.AdaptiveObject14Adaptify.Compiler.AdaptiveTypes.AdaptiveToken15Adaptify.Compiler.AdaptiveTypes.Adaptor16Adaptify.Compiler.AdaptiveTypes.CList17Adaptify.Compiler.AdaptiveTypes.CMap18Adaptify.Compiler.AdaptiveTypes.CSet19Adaptify.Compiler.AdaptiveTypes.CVal20Adaptify.Compiler.AdaptiveTypes.CValCustomEquality21Adaptify.Compiler.AdaptiveTypes.ChangeableListArray22Adaptify.Compiler.AdaptiveTypes.ChangeableListList23Adaptify.Compiler.AdaptiveTypes.ChangeableModelList24Adaptify.Compiler.AdaptiveTypes.ChangeableModelListArray25Adaptify.Compiler.AdaptiveTypes.ChangeableModelListList26Adaptify.Compiler.AdaptiveTypes.ChangeableModelMap27Adaptify.Compiler.AdaptiveTypes.HashMap28Adaptify.Compiler.AdaptiveTypes.HashSet29Adaptify.Compiler.AdaptiveTypes.IndexList30Adaptify.Compiler.AdaptiveTypes.Lazy31Adaptify.Compiler.AdaptiveTypes.List32Adaptify.Compiler.AdaptiveTypes.Object33Adaptify.Compiler.AdaptiveTypes.Option34Adaptify.Compiler.AdaptiveTypes.Transaction35Adaptify.Compiler.AdaptorModule36Adaptify.Compiler.Client37Adaptify.Compiler.IPC38Adaptify.FSharp.Core39Adaptify.Compiler.Server40111223111212122222222222211121122621521+37 more modules (most-connected shown)

At a glance — Code Health · 76% · Adequate · gated by D2, D4 ·

At a glance — Architecture · 100% · Exemplary ·

At a glance — Maturity · 44% · Weak · gated by D34, M2 ·

At a glance — Readiness · 61% · Adequate · gated by P3 ·

At a glance — Security · 75% · Adequate · gated by D36 ·

At a glance — Performance · 85% · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures11High / Critical
A05:2025 — Injection9High / Critical

Roadmap

Top priorities: Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Adaptify.MSBuild.fsproj; 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; Resolve the 13 Orphaned file finding(s) in Knowledge Freshness — start with Program.fs (2), Process.fs, Utilities.fs.

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

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Adaptify.MSBuild.fsproj.+12.6 ptsLowADR Quality
Resolve the 13 Orphaned file finding(s) in Knowledge Freshness — start with Program.fs (2), Process.fs, Utilities.fs.+10.0 ptsMediumKnowledge Freshness
Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with CoreInstances.fs, Adaptor.fs, Runner.fs.+3.1 ptsLowKnowledge Freshness
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.+11.2 ptsMediumArchitecture documentation
Resolve the 6 Low coverage finding(s) in Code Coverage — start with Process.fs, Server.fs, Cache.fs.+2.0 ptsLowCode Coverage
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+1.9 ptsLowBus Factor
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.+3.8 ptsMediumDocumentation (README)
Resolve the 2 Hotspot finding(s) in Churn × Complexity Hotspots — start with Adaptor.fs, Types.fs.+0.9 ptsMediumChurn × Complexity Hotspots

File quality

Per-file score 0–10 — a quality signature. Of 19 files carrying findings, judged against the Production bar: 5% slop · 63% mixed · 32% near-clean.

FileScoreBandWorst signal
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedDependency Vulnerabilities: High CVE: REDACTED
src/Adaptify.Compiler/ProjectInfo.fs5.6MixedCyclomatic Complexity: ProjectInfoModule.ofFscArgs (cyclomatic 27)
src/Adaptify.Compiler/CoreTypes.fs6.3MixedCode Duplication: Duplicated block (13 lines × 2)
src/Adaptify.Compiler/Adaptor.fs7.0MixedCyclomatic Complexity: TypeDefinitionModule.productType (cyclomatic 43)
src/Adaptify.Compiler/Server.fs7.0MixedCognitive Complexity: Client.adaptify (cognitive 21)
src/Adaptify.Compiler/Process.fs7.0MixedCognitive Complexity: ProcessManagement.startAdaptifyServer (cognitive 21)
src/Adaptify.Compiler/Scope.fs7.0MixedCognitive Complexity: ScopeModule.ofFSharpEntity (cognitive 16)
src/Adaptify.Core/CoreInstances.fs7.0MixedGod Classes: FileTooLong: Adaptify.Core/CoreInstances.fs
src/Adaptify.Compiler/Runner.fs7.1MixedCyclomatic Complexity: Adaptify.runAsync (cyclomatic 84)
src/Adaptify.Compiler/Ast.fs7.8MixedCyclomatic Complexity: ExprModule.toString (cyclomatic 53)
src/adaptify/Program.fs7.8MixedCyclomatic Complexity: Program.main (cyclomatic 29)
src/Adaptify.Compiler/Types.fs7.8MixedCyclomatic Complexity: TypeRefModule.toString (cyclomatic 21)
src/Adaptify.Compiler/Utilities.fs8.5Near-cleanCognitive Complexity: Process.tryStart (cognitive 17)
src/Adaptify.Core/Helpers.fs8.5Near-cleanCode Duplication: Duplicated block (7 lines × 2)
src/Examples/Net10/Model.fs8.5Near-cleanCode Duplication: Duplicated block (26 lines × 3)
src/Examples/Net10/Program.fs8.5Near-cleanCode Duplication: Duplicated block (83 lines × 2)
src/Adaptify.Compiler/Cache.fs8.5Near-cleanCode Coverage: Low coverage: src/Adaptify.Compiler/Cache.fs
src/Adaptify.MSBuild/Adaptify.MSBuild.fsproj9.5Near-cleanADR Quality: No ADRs found

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

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

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

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

Could not be resolved — 6

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

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

What we checked — 37 dimensions across the health lenses
D1D2D3D4D5D6D8D11D13D14D15D16D17D19D20D27D28D29D30D34D35D36D43D44AX10AX3AX4AX5GD1M1M2M3P1P3P4P6PF3

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, 96 of 108 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 01a1deb2-e685-7869-ad67-7997ead77306.

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.

  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
  • D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/Adaptify.Compiler/Adaptor.fs, src/Adaptify.Compiler/Types.fs that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Cannot open project 'src/Adaptify.Compiler/Adaptify.Compiler.fsproj' because the file extension '.fsproj' is not associated with a language.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 0 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (6,936 lines, 100% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
  • D22 Internal API Consistency — 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. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
  • 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • 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 is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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.
  • 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's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X28 Index access outside its own emptiness 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's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.

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.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • 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.
  • 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 Complexity7.3 / 10Strong✓ 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 7.3 / 10 · rule-coverage 100% · ceiling Prevented

9 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Adaptify.runAsync at 84. A further 1 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 ExprModule.substitute at 21 — they are counted neither in the figure above nor in this dimension's score.

Adaptify.runAsync (cyclomatic 84)src/Adaptify.Compiler/Runner.fs:145
ExprModule.toString (cyclomatic 53)src/Adaptify.Compiler/Ast.fs:194
TypeDefinitionModule.productType (cyclomatic 43)src/Adaptify.Compiler/Adaptor.fs:1095
TypeDefinitionModule.toString (cyclomatic 42)src/Adaptify.Compiler/Adaptor.fs:886
Program.main (cyclomatic 29)src/adaptify/Program.fs:141

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

What to do

  1. Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with Adaptify.runAsync (cyclomatic 84). — Refactoring it lifts Cyclomatic Complexity from 7.3 to about 7.7/10.

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

D2 · Cognitive Complexity3.3 / 10Weak✓ 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 3.3 / 10 · rule-coverage 100% · ceiling Prevented

14 method(s) exceeded the cognitive complexity threshold of 15; the worst was Adaptify.runAsync at 342.

Adaptify.runAsync (cognitive 342)src/Adaptify.Compiler/Runner.fs:145
TypeDefinitionModule.toString (cognitive 118)src/Adaptify.Compiler/Adaptor.fs:886
ExprModule.toString (cognitive 72)src/Adaptify.Compiler/Ast.fs:194
Program.main (cognitive 58)src/adaptify/Program.fs:141
TypeDefinitionModule.productType (cognitive 40)src/Adaptify.Compiler/Adaptor.fs:1095

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

What to do

  1. Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with Adaptify.runAsync (cognitive 342). — Refactoring it lifts Cognitive Complexity from 3.3 to about 5.2/10.

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

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

2 over-large unit(s) detected — types, modules or files that carry too much.

FileTooLong: Adaptify.Compiler/Adaptor.fs · ×2src/Adaptify.Compiler/Adaptor.fs

What to do

  1. Resolve the 2 FileTooLong finding(s) in God Classes — start with Adaptor.fs, CoreInstances.fs. — One of this dimension's main actionable groups (2 warning-level).

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

D4 · Code Duplication3.9 / 10Weak✓ 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 3.9 / 10 · rule-coverage 100% · ceiling Verified

29 duplicated block group(s) detected. 15.2 % of the production lines (1,053 of 6,949) are in a reported copy. 2 of the 29 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 (7 lines × 2) · ×4src/Adaptify.Compiler/Adaptor.fs:1313
Duplicated block (7 lines × 3) · ×3src/Adaptify.Core/CoreInstances.fs:94
Duplicated block (8 lines × 3) · ×2src/Adaptify.Core/CoreInstances.fs:125
Duplicated block (1–7 lines × 4) · ×2src/Adaptify.Core/CoreInstances.fs:107
Duplicated block (43 lines × 2)src/Adaptify.Compiler/Adaptor.fs:935

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

What to do

  1. Resolve the 4 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with Adaptor.fs, CoreInstances.fs, ProjectInfo.fs. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 3 Duplicated block (7 lines × 3) finding(s) in Code Duplication — start with CoreInstances.fs (2), CoreTypes.fs. — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 2 Duplicated block (8 lines × 3) finding(s) in Code Duplication — start with CoreInstances.fs (2). — One of this dimension's main actionable groups (2 warning-level).

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

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

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

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

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

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

1 projects, 0 dependency cycle(s), 0 unstable depended-on project(s).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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

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

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

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

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

0 of 21 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D8 · Code Coverage8.4 / 10Strong✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

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

Line coverage 47.5% — 6 file(s) below 50%.

Low coverage: src/Adaptify.Compiler/Process.fs · ×6src/Adaptify.Compiler/Process.fs:1

What to do

  1. Resolve the 6 Low coverage finding(s) in Code Coverage — start with Process.fs, Server.fs, Cache.fs. — One of this dimension's main actionable groups (6 warning-level).

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

D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 1 measured tier(s). unit: measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

0 of 115 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 4 direct `PackageReference`(s), and 103 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

Top hotspots: src/Adaptify.Compiler/Adaptor.fs (4×43=172); src/Adaptify.Compiler/Types.fs (3×21=63)

Hotspot: src/Adaptify.Compiler/Adaptor.fs · ×2src/Adaptify.Compiler/Adaptor.fs:1095

What to do

  1. Resolve the 2 Hotspot finding(s) in Churn × Complexity Hotspots — start with Adaptor.fs, Types.fs. — One of this dimension's main actionable groups (2 warning-level).

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

D16 · Bus Factor8.8 / 10Strong✓ Tool-verified

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

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

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

2 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Adaptify.Compiler/Adaptor.fs.

Off-boarding risk: anonymized user #1

What to do

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

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

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

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

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

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

0 deducted debt markers + unmeasured dead symbols across 13 LoC in the .NET projects (0.0/KLoC) → score 10.0. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (100% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

✓ 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. 1 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

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

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

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

No architecture decision records were found.

No ADRs foundsrc/Adaptify.MSBuild/Adaptify.MSBuild.fsproj:4

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Adaptify.MSBuild.fsproj. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_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

94 % of calls cross a namespace and 6 % go through an interface, but 98 % 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)10.0 / 10Adequategated by 9 critical findings○ Nothing flagged

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

9 finding(s): 0 critical, 9 high, 0 medium, 0 low. 9 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.

REDACTED

What to do

  1. No action in Static Analysis (SAST) — all 9 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 (9 issue-level, 0 of them charged here).

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

D30 · Dependency Vulnerabilities6.9 / 10Adequate✓ 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 6.9 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED

What to do

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

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

D34 · Knowledge Freshness0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

16 of 16 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/Adaptify.Core/CoreInstances.fs.

Orphaned knowledge · ×3src/Adaptify.Core/CoreInstances.fs:1
Orphaned file · ×13src/Adaptify.Compiler/Process.fs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 13 Orphaned file finding(s) in Knowledge Freshness — start with Program.fs (2), Process.fs, Utilities.fs. — One of this dimension's main actionable groups (13 recommendation-level).
  2. Resolve the 3 Orphaned knowledge finding(s) in Knowledge Freshness — start with CoreInstances.fs, Adaptor.fs, Runner.fs. — One of this dimension's main actionable groups (3 issue-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & 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

+ 1 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. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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.

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

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

Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

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

M1 · Documentation (README)6.0 / 10Adequate✓ 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

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • 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 documentation0.0 / 10Critical✓ 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.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

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.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
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.

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.

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 `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 1 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` 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:26

What to do

  • Add a SAST step to CI running what this repository's stack ships: `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) — 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 & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

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 hygiene8.5 / 10Strong✓ Tool-verified

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

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

  • `retry` is async and calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/Adaptify.Compiler/Process.fs:109

What to do

  • F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.

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 Health76%Adequate — gated by D2, D4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture100%ExemplaryStrongest area.
Maturity44%Weak — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness61%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security75%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance85%StrongSolid.
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.

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Not evidenced — 1 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.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 74 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 — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — no public interfaces
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • 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 — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality — ~175 lines of test source are present (.fs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D12 Dependency Hygiene — Dependency hygiene not measured
  • D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .fs, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
  • D21 Naming Consistency — N/A — too few peers to establish a naming convention (1141 declarations, no unit with a dominant convention).
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — small single-context codebase (6,949 production LoC in the .NET projects) — bounded contexts are not needed at this size 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; comments in this repository's .fs source were not judged.
  • D25 ADR Conformance — no ADRs to check
  • D26 Project Cohesion — This repository is one project, `LibraryCSharp` (13 LoC, 1 public types across 1 namespaces), within the size bounds. Not scored: a single unit of this size gives project cohesion nothing to grade.
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • 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 dependency cycles — architectural integrity not assessed
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (18 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • 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
  • M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
  • P2 Observability — This repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
  • P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
  • P8 Schema migrations — no EF Core usage detected
  • P9 Domain vs controller coverage — coverage data present for 12 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • PF2 Allocation hygiene — 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 — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — no async method does work a token could cancel
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — X23 reached only 0% of this repository's production lines — fsharp (6,936 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — X28 reached only 0% of this repository's production lines — fsharp (6,936 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X5 Nullable reference types — no NRT-eligible projects
  • 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 — 17 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×3
  • Orphaned knowledge src/Adaptify.Core/CoreInstances.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge src/Adaptify.Compiler/Adaptor.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
  • Orphaned knowledge src/Adaptify.Compiler/Runner.fs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Serious — 67 finding(s)
D8 · Code Coverage · Low coverage · ×6
  • Low coverage: src/Adaptify.Compiler/Process.fs src/Adaptify.Compiler/Process.fs:1 — 0.0% line coverage (0/356).
  • Low coverage: src/Adaptify.Compiler/Server.fs src/Adaptify.Compiler/Server.fs:1 — 0.0% line coverage (0/229).
  • Low coverage: src/Adaptify.Compiler/Cache.fs src/Adaptify.Compiler/Cache.fs:1 — 24.6% line coverage (15/61).
  • Low coverage: src/Adaptify.Compiler/ProjectInfo.fs src/Adaptify.Compiler/ProjectInfo.fs:1 — 44.6% line coverage (119/267).
  • Low coverage: src/Adaptify.Compiler/CoreTypes.fs src/Adaptify.Compiler/CoreTypes.fs:1 — 32.9% line coverage (103/313).
  • Low coverage: src/Adaptify.Compiler/Scope.fs src/Adaptify.Compiler/Scope.fs:1 — 34.9% line coverage (22/63).
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) src/Adaptify.Compiler/Adaptor.fs:1313 — src/Adaptify.Compiler/Adaptor.fs:1313-1319 | src/Adaptify.Compiler/Adaptor.fs:1657-1663 — 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 `src/Adaptify.Compiler/Adaptor.fs:1313` 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) src/Adaptify.Core/CoreInstances.fs:264 — src/Adaptify.Core/CoreInstances.fs:264-270 | src/Adaptify.Core/CoreInstances.fs:500-506 — 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) src/Adaptify.Compiler/ProjectInfo.fs:207 — src/Adaptify.Compiler/ProjectInfo.fs:207-213 | src/Adaptify.Compiler/Runner.fs:166-172 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) src/Adaptify.Core/Helpers.fs:39 — src/Adaptify.Core/Helpers.fs:39-45 | src/Adaptify.Core/Helpers.fs:52-58 — 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 lines × 3) · ×3
  • Duplicated block (7 lines × 3) src/Adaptify.Core/CoreInstances.fs:94 — src/Adaptify.Core/CoreInstances.fs:94-100 | src/Adaptify.Core/CoreInstances.fs:192-198 | src/Adaptify.Core/CoreInstances.fs:388-394 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (7 lines × 3) src/Adaptify.Core/CoreInstances.fs:116 — src/Adaptify.Core/CoreInstances.fs:116-122 | src/Adaptify.Core/CoreInstances.fs:228-234 | src/Adaptify.Core/CoreInstances.fs:444-450 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (7 lines × 3) src/Adaptify.Compiler/CoreTypes.fs:342 — src/Adaptify.Compiler/CoreTypes.fs:342-348 | src/Adaptify.Compiler/CoreTypes.fs:370-377 | src/Adaptify.Compiler/CoreTypes.fs:401-408 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Adaptify.Compiler/CoreTypes.fs:342` 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×2
  • Hotspot: src/Adaptify.Compiler/Adaptor.fs src/Adaptify.Compiler/Adaptor.fs:1095 — src/Adaptify.Compiler/Adaptor.fs changed 4 times in last 90 days, max cyclomatic complexity 43 in TypeDefinitionModule.productType at line 1095. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2025-09-11..2025-12-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-09-11 11:57:06 +01:00' --until='2025-12-10 11:57:06 +01:00' --full-history --no-merges -- src/Adaptify.Compiler/Adaptor.fs`: 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: src/Adaptify.Compiler/Types.fs src/Adaptify.Compiler/Types.fs:231 — src/Adaptify.Compiler/Types.fs changed 3 times in last 90 days, max cyclomatic complexity 21 in TypeRefModule.toString at line 231. 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 2025-09-11..2025-12-10, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-09-11 11:57:06 +01:00' --until='2025-12-10 11:57:06 +01:00' --full-history --no-merges -- src/Adaptify.Compiler/Types.fs`: 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.
D3 · God Classes · FileTooLong · ×2
  • FileTooLong: Adaptify.Compiler/Adaptor.fs src/Adaptify.Compiler/Adaptor.fs — FileTooLong — 1337 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 837 over it, 2.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: Adaptify.Core/CoreInstances.fs src/Adaptify.Core/CoreInstances.fs — FileTooLong — 860 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 360 over it, 1.72× 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 · Duplicated block (8 lines × 3) · ×2
  • Duplicated block (8 lines × 3) src/Adaptify.Core/CoreInstances.fs:125 — src/Adaptify.Core/CoreInstances.fs:125-132 | src/Adaptify.Core/CoreInstances.fs:141-148 | src/Adaptify.Core/CoreInstances.fs:160-167 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (8 lines × 3) src/Adaptify.Core/CoreInstances.fs:798 — src/Adaptify.Core/CoreInstances.fs:798-805 | src/Adaptify.Core/CoreInstances.fs:814-821 | src/Adaptify.Core/CoreInstances.fs:833-840 — 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 (1–7 lines × 4) · ×2
  • Duplicated block (1–7 lines × 4) src/Adaptify.Core/CoreInstances.fs:107 — src/Adaptify.Core/CoreInstances.fs:107-113 | src/Adaptify.Core/CoreInstances.fs:134-134 | src/Adaptify.Core/CoreInstances.fs:150-156 | src/Adaptify.Core/CoreInstances.fs:169-175 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (1–7 lines × 4) src/Adaptify.Core/CoreInstances.fs:780 — src/Adaptify.Core/CoreInstances.fs:780-786 | src/Adaptify.Core/CoreInstances.fs:807-807 | src/Adaptify.Core/CoreInstances.fs:823-829 | src/Adaptify.Core/CoreInstances.fs:842-848 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D1 · Cyclomatic Complexity · Adaptify.runAsync (cyclomatic 84) · ×1
  • Adaptify.runAsync (cyclomatic 84) src/Adaptify.Compiler/Runner.fs:145 — Adaptify.runAsync has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ExprModule.toString (cyclomatic 53) · ×1
  • ExprModule.toString (cyclomatic 53) src/Adaptify.Compiler/Ast.fs:194 — ExprModule.toString has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TypeDefinitionModule.productType (cyclomatic 43) · ×1
  • TypeDefinitionModule.productType (cyclomatic 43) src/Adaptify.Compiler/Adaptor.fs:1095 — TypeDefinitionModule.productType has cyclomatic complexity 43 (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 · TypeDefinitionModule.toString (cyclomatic 42) · ×1
  • TypeDefinitionModule.toString (cyclomatic 42) src/Adaptify.Compiler/Adaptor.fs:886 — TypeDefinitionModule.toString has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Program.main (cyclomatic 29) · ×1
  • Program.main (cyclomatic 29) src/adaptify/Program.fs:141 — Program.main has cyclomatic complexity 29 (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 · ProjectInfoModule.ofFscArgs (cyclomatic 27) · ×1
  • ProjectInfoModule.ofFscArgs (cyclomatic 27) src/Adaptify.Compiler/ProjectInfo.fs:37 — ProjectInfoModule.ofFscArgs has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · AdaptorModule.get (cyclomatic 27) · ×1
  • AdaptorModule.get (cyclomatic 27) src/Adaptify.Compiler/Adaptor.fs:537 — AdaptorModule.get has cyclomatic complexity 27 (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 · TypeRefModule.toString (cyclomatic 21) · ×1
  • TypeRefModule.toString (cyclomatic 21) src/Adaptify.Compiler/Types.fs:231 — TypeRefModule.toString has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ProjectInfoModule.computeHash (cyclomatic 16) · ×1
  • ProjectInfoModule.computeHash (cyclomatic 16) src/Adaptify.Compiler/ProjectInfo.fs:201 — ProjectInfoModule.computeHash has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D2 · Cognitive Complexity · Adaptify.runAsync (cognitive 342) · ×1
  • Adaptify.runAsync (cognitive 342) src/Adaptify.Compiler/Runner.fs:145 — Adaptify.runAsync has cognitive complexity 342 (threshold 15). Drivers by points: if/else 71 (228 pts), match/switch 12 (57 pts), loops 7 (35 pts), error handling 2 (16 pts), boolean chains 6 (nesting depth added 244). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: src/Adaptify.Compiler/Runner.fs holds 2 of the 14 methods over the threshold — including the worst — and 330 of the 623 points over it (53%), 2× the next-largest file (src/Adaptify.Compiler/Adaptor.fs at 161). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · TypeDefinitionModule.toString (cognitive 118) · ×1
  • TypeDefinitionModule.toString (cognitive 118) src/Adaptify.Compiler/Adaptor.fs:886 — TypeDefinitionModule.toString has cognitive complexity 118 (threshold 15). Drivers by points: if/else 44 (90 pts), loops 9 (19 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ExprModule.toString (cognitive 72) · ×1
  • ExprModule.toString (cognitive 72) src/Adaptify.Compiler/Ast.fs:194 — ExprModule.toString has cognitive complexity 72 (threshold 15). Drivers by points: if/else 40 (63 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 26). 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 · Program.main (cognitive 58) · ×1
  • Program.main (cognitive 58) src/adaptify/Program.fs:141 — Program.main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (13 pts), error handling 2 (7 pts), boolean chains 6, match/switch 3 (6 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 · TypeDefinitionModule.productType (cognitive 40) · ×1
  • TypeDefinitionModule.productType (cognitive 40) src/Adaptify.Compiler/Adaptor.fs:1095 — TypeDefinitionModule.productType has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 17 (25 pts), if/else 7 (9 pts), loops 5 (6 pts) (nesting depth added 11). 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 · AdaptorModule.get (cognitive 39) · ×1
  • AdaptorModule.get (cognitive 39) src/Adaptify.Compiler/Adaptor.fs:537 — AdaptorModule.get has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 8 (19 pts) (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ProjectInfoModule.ofFscArgs (cognitive 29) · ×1
  • ProjectInfoModule.ofFscArgs (cognitive 29) src/Adaptify.Compiler/ProjectInfo.fs:37 — ProjectInfoModule.ofFscArgs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23 (24 pts), match/switch 4 (5 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · TypeDefinitionModule.ofTypeDef (cognitive 24) · ×1
  • TypeDefinitionModule.ofTypeDef (cognitive 24) src/Adaptify.Compiler/Adaptor.fs:1435 — TypeDefinitionModule.ofTypeDef has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (9 pts), loops 2 (4 pts), boolean chains 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 · Client.adaptify (cognitive 21) · ×1
  • Client.adaptify (cognitive 21) src/Adaptify.Compiler/Server.fs:301 — Client.adaptify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProcessManagement.startAdaptifyServer (cognitive 21) · ×1
  • ProcessManagement.startAdaptifyServer (cognitive 21) src/Adaptify.Compiler/Process.fs:496 — ProcessManagement.startAdaptifyServer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (6 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Adaptify.waitUntilExisting (cognitive 18) · ×1
  • Adaptify.waitUntilExisting (cognitive 18) src/Adaptify.Compiler/Runner.fs:14 — Adaptify.waitUntilExisting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: src/Adaptify.Compiler/Runner.fs holds 2 of the 14 methods over the threshold — including the worst — and 330 of the 623 points over it (53%), 2× the next-largest file (src/Adaptify.Compiler/Adaptor.fs at 161). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · TypeRefModule.ofType (cognitive 18) · ×1
  • TypeRefModule.ofType (cognitive 18) src/Adaptify.Compiler/Types.fs:174 — TypeRefModule.ofType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (7 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Process.tryStart (cognitive 17) · ×1
  • Process.tryStart (cognitive 17) src/Adaptify.Compiler/Utilities.fs:334 — Process.tryStart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (4 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ScopeModule.ofFSharpEntity (cognitive 16) · ×1
  • ScopeModule.ofFSharpEntity (cognitive 16) src/Adaptify.Compiler/Scope.fs:13 — ScopeModule.ofFSharpEntity has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (nesting depth added 7). 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Duplicated block (43 lines × 2) · ×1
  • Duplicated block (43 lines × 2) src/Adaptify.Compiler/Adaptor.fs:935 — src/Adaptify.Compiler/Adaptor.fs:935-977 | src/Adaptify.Compiler/Adaptor.fs:1006-1048 — 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 (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) src/Adaptify.Compiler/Adaptor.fs:711 — src/Adaptify.Compiler/Adaptor.fs:711-732 | src/Adaptify.Compiler/Adaptor.fs:789-810 — 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 `src/Adaptify.Compiler/Adaptor.fs:711` 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 (28–30 lines × 3) · ×1
  • Duplicated block (28–30 lines × 3) src/Adaptify.Compiler/Adaptor.fs:647 — src/Adaptify.Compiler/Adaptor.fs:647-674 | src/Adaptify.Compiler/Adaptor.fs:760-789 | src/Adaptify.Compiler/Adaptor.fs:1534-1563 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Adaptify.Compiler/Adaptor.fs:1565` calls `TExtRef` and `src/Adaptify.Compiler/Adaptor.fs:790` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) src/Adaptify.Compiler/Adaptor.fs:350 — src/Adaptify.Compiler/Adaptor.fs:350-368 | src/Adaptify.Compiler/Adaptor.fs:388-406 — 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 `src/Adaptify.Compiler/Adaptor.fs:350` 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 (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) src/Adaptify.Compiler/Adaptor.fs:627 — src/Adaptify.Compiler/Adaptor.fs:627-642 | src/Adaptify.Compiler/Adaptor.fs:740-756 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/Adaptify.Compiler/Adaptor.fs:644` calls `TExtRef`, `sprintf` and `src/Adaptify.Compiler/Adaptor.fs:758` 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 (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) src/Adaptify.Compiler/CoreTypes.fs:181 — src/Adaptify.Compiler/CoreTypes.fs:181-193 | src/Adaptify.Compiler/CoreTypes.fs:203-215 — 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 `src/Adaptify.Compiler/CoreTypes.fs:181` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) src/Adaptify.Compiler/Runner.fs:66 — src/Adaptify.Compiler/Runner.fs:66-75 | src/Adaptify.Compiler/Runner.fs:479-489 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • Duplicated block (9–10 lines × 2) src/Adaptify.Compiler/Adaptor.fs:524 — src/Adaptify.Compiler/Adaptor.fs:524-532 | src/Adaptify.Compiler/Adaptor.fs:1069-1078 — 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 (9 lines × 2) · ×1
  • Duplicated block (9 lines × 2) src/Adaptify.Compiler/Runner.fs:86 — src/Adaptify.Compiler/Runner.fs:86-94 | src/Adaptify.Compiler/Runner.fs:501-509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (8 lines × 32) · ×1
  • Duplicated block (8 lines × 32) src/Adaptify.Core/CoreInstances.fs:207 — src/Adaptify.Core/CoreInstances.fs:207-214 | src/Adaptify.Core/CoreInstances.fs:218-225 | src/Adaptify.Core/CoreInstances.fs:240-247 | src/Adaptify.Core/CoreInstances.fs:254-261 | src/Adaptify.Core/CoreInstances.fs:276-283 | src/Adaptify.Core/CoreInstances.fs:287-294 | src/Adaptify.Core/CoreInstances.fs:306-313 | src/Adaptify.Core/CoreInstances.fs:317-324 | src/Adaptify.Core/CoreInstances.fs:328-335 | src/Adaptify.Core/CoreInstances.fs:342-349 | src/Adaptify.Core/CoreInstances.fs:353-360 | src/Adaptify.Core/CoreInstances.fs:364-371 | src/Adaptify.Core/CoreInstances.fs:403-410 | src/Adaptify.Core/CoreInstances.fs:417-424 | src/Adaptify.Core/CoreInstances.fs:431-438 | src/Adaptify.Core/CoreInstances.fs:456-463 | src/Adaptify.Core/CoreInstances.fs:473-480 | src/Adaptify.Core/CoreInstances.fs:487-494 | src/Adaptify.Core/CoreInstances.fs:512-519 | src/Adaptify.Core/CoreInstances.fs:526-533 | src/Adaptify.Core/CoreInstances.fs:543-550 | src/Adaptify.Core/CoreInstances.fs:568-575 | src/Adaptify.Core/CoreInstances.fs:582-589 | src/Adaptify.Core/CoreInstances.fs:596-603 | src/Adaptify.Core/CoreInstances.fs:618-625 | src/Adaptify.Core/CoreInstances.fs:632-639 | src/Adaptify.Core/CoreInstances.fs:646-653 | src/Adaptify.Core/CoreInstances.fs:660-667 | src/Adaptify.Core/CoreInstances.fs:677-684 | src/Adaptify.Core/CoreInstances.fs:691-698 | src/Adaptify.Core/CoreInstances.fs:705-712 | src/Adaptify.Core/CoreInstances.fs:719-726 — all 32 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 (7 lines × 4) · ×1
  • Duplicated block (7 lines × 4) src/Adaptify.Compiler/Adaptor.fs:317 — src/Adaptify.Compiler/Adaptor.fs:317-323 | src/Adaptify.Compiler/Adaptor.fs:342-348 | src/Adaptify.Compiler/Adaptor.fs:380-386 | src/Adaptify.Compiler/Adaptor.fs:453-459 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (6 lines × 38) · ×1
  • Duplicated block (6 lines × 38) src/Adaptify.Core/CoreInstances.fs:108 — src/Adaptify.Core/CoreInstances.fs:108-113 | src/Adaptify.Core/CoreInstances.fs:127-132 | src/Adaptify.Core/CoreInstances.fs:143-148 | src/Adaptify.Core/CoreInstances.fs:151-156 | src/Adaptify.Core/CoreInstances.fs:162-167 | src/Adaptify.Core/CoreInstances.fs:170-175 | src/Adaptify.Core/CoreInstances.fs:206-211 | src/Adaptify.Core/CoreInstances.fs:217-222 | src/Adaptify.Core/CoreInstances.fs:239-244 | src/Adaptify.Core/CoreInstances.fs:253-258 | src/Adaptify.Core/CoreInstances.fs:275-280 | src/Adaptify.Core/CoreInstances.fs:286-291 | src/Adaptify.Core/CoreInstances.fs:305-310 | src/Adaptify.Core/CoreInstances.fs:316-321 | src/Adaptify.Core/CoreInstances.fs:327-332 | src/Adaptify.Core/CoreInstances.fs:341-346 | src/Adaptify.Core/CoreInstances.fs:352-357 | src/Adaptify.Core/CoreInstances.fs:363-368 | src/Adaptify.Core/CoreInstances.fs:402-407 | src/Adaptify.Core/CoreInstances.fs:416-421 | src/Adaptify.Core/CoreInstances.fs:430-435 | src/Adaptify.Core/CoreInstances.fs:455-460 | src/Adaptify.Core/CoreInstances.fs:472-477 | src/Adaptify.Core/CoreInstances.fs:486-491 | src/Adaptify.Core/CoreInstances.fs:511-516 | src/Adaptify.Core/CoreInstances.fs:525-530 | src/Adaptify.Core/CoreInstances.fs:542-547 | src/Adaptify.Core/CoreInstances.fs:567-572 | src/Adaptify.Core/CoreInstances.fs:581-586 | src/Adaptify.Core/CoreInstances.fs:595-600 | src/Adaptify.Core/CoreInstances.fs:617-622 | src/Adaptify.Core/CoreInstances.fs:631-636 | src/Adaptify.Core/CoreInstances.fs:645-650 | src/Adaptify.Core/CoreInstances.fs:659-664 | src/Adaptify.Core/CoreInstances.fs:676-681 | src/Adaptify.Core/CoreInstances.fs:690-695 | src/Adaptify.Core/CoreInstances.fs:704-709 | src/Adaptify.Core/CoreInstances.fs:718-723 — all 38 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Adaptify.Core/CoreInstances.fs:105` calls `Update`, `Choice2Of2` and `src/Adaptify.Core/CoreInstances.fs:126` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 6) · ×1
  • Duplicated block (6 lines × 6) src/Adaptify.Core/CoreInstances.fs:781 — src/Adaptify.Core/CoreInstances.fs:781-786 | src/Adaptify.Core/CoreInstances.fs:800-805 | src/Adaptify.Core/CoreInstances.fs:816-821 | src/Adaptify.Core/CoreInstances.fs:824-829 | src/Adaptify.Core/CoreInstances.fs:835-840 | src/Adaptify.Core/CoreInstances.fs:843-848 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Adaptify.Core/CoreInstances.fs:778` calls `Update`, `Error` and `src/Adaptify.Core/CoreInstances.fs:799` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) src/Adaptify.Compiler/ProjectInfo.fs:98 — src/Adaptify.Compiler/ProjectInfo.fs:98-105 | src/Adaptify.Compiler/ProjectInfo.fs:111-118 — 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 `src/Adaptify.Compiler/ProjectInfo.fs:98` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) src/Adaptify.Core/CoreInstances.fs:36 — src/Adaptify.Core/CoreInstances.fs:36-40 | src/Adaptify.Core/CoreInstances.fs:49-53 | src/Adaptify.Core/CoreInstances.fs:62-66 — 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 (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) src/Adaptify.Compiler/Adaptor.fs:325 — src/Adaptify.Compiler/Adaptor.fs:325-331 | src/Adaptify.Compiler/Adaptor.fs:461-465 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/Adaptify.Compiler/Adaptor.fs:325` 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 (26 lines × 3) · ×1
  • Duplicated block (26 lines × 3) src/Examples/Net10/Model.fs:1 — src/Examples/Net10/Model.fs:1-26 | src/Examples/Net8/Model.fs:1-26 | src/Examples/Net9/Model.fs:1-26 — `src/Examples/Net10/Model.fs` and `src/Examples/Net8/Model.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 26 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (83 lines × 2) · ×1
  • Duplicated block (83 lines × 2) src/Examples/Net10/Program.fs:1 — src/Examples/Net10/Program.fs:1-83 | src/Examples/Net9/Program.fs:1-83 — `src/Examples/Net10/Program.fs` and `src/Examples/Net9/Program.fs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 83 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
P12 · CI test-gate honesty · Test suite runs only after the merge · ×1
  • Test suite runs only after the merge — `REDACTED` run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) — so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×1
  • Sync-over-async blocking src/Adaptify.Compiler/Process.fs:109 — `retry` is async and calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 24 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×13
  • Orphaned file src/Adaptify.Compiler/Process.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Utilities.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Ast.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/CoreTypes.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Server.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Types.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/ProjectInfo.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/adaptify/Program.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.MSBuild/Program.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Cache.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Compiler/Scope.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Core/Helpers.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/Adaptify.Core/Attributes.fs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: src/Adaptify.Compiler/Adaptor.fs, src/Adaptify.Core/Attributes.fs. Pair on, review, or document these before any departure.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found src/Adaptify.MSBuild/Adaptify.MSBuild.fsproj:4 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `src/Adaptify.MSBuild/Adaptify.MSBuild.fsproj` makes this repository a deployable product (line 4).
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 13 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: src/Adaptify.Compiler/Process.fs, src/Adaptify.Compiler/Utilities.fs, src/Adaptify.Compiler/Ast.fs, src/Adaptify.Compiler/CoreTypes.fs, src/Adaptify.Compiler/Server.fs, src/Adaptify.Compiler/Types.fs, src/Adaptify.Compiler/ProjectInfo.fs, src/adaptify/Program.fs (and 5 more) (16 orphaned of 16 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
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.
M2 · Architecture documentation · No architecture diagram/doc · ×1
  • No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add `semgrep --config=auto` plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 1 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:26 — `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`.

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 --report-format json --report-path /tmp/watchdog-gitleaks-cba078c1d1264b57ab0d46eceb495cf6/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.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-cba078c1d1264b57ab0d46eceb495cf6/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 .9artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesdotnet—dotnet list src/Adaptify.sln package --vulnerable --include-transitive --format json5artifacts/raw/dotnet-vulnerable.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-24f1e99d24a243f3ace731772d5b76470artifacts/raw/osv-scanner.json

Run 01a1deb2-e685-7869-ad67-7997ead77306 · 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