Public report of iminashi/Rocksmith2014.NET, 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, 09:01 UTC · Survey ID cd_4b52fe9b1d4f496fb8858ef4a71bc196

iminashi/Rocksmith2014.NET

Measured 15 November 2026, 09:00 UTC, at code version 4cf3325

Test reliability is not measured: No test run produced results.

Boundary Type-Coupling is not measured: Bounded contexts not declared.

CAI score 55out 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 medium codebase: 29,892 lines of product code in 3 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 44

Findings by how serious they are

7 critical 117 serious 14 minor

14 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, 09:00 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 ▸

40of 40 dimensions measured by tools.
127of 138 findings point to an exact file and line, so you can open each one in the code. The other 11 concern the repository as a whole, such as missing documentation.
40dimensions across 6 lenses, read from 29,892 lines of product code in 3 projects.
Chapters

Executive summary

iminashi/Rocksmith2014.NET falls short of our standard for production, in part because we found no automated security scanning of the code, its secrets or its dependencies. It scores 55 out of 100 and is rated Adequate, and all seven of its critical findings are security problems.

Production Readiness, at 44, is the weakest lens and counts most in the score. The best first step is improving the documentation, worth about 6 points. Automating the release would lift Production Readiness itself, also worth about 6. Raising Production Readiness to 70 would lift the score to about 63.

Six pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One password or key is open to anyone who can read the repository. Pinning each tool to an exact version and replacing the exposed password or key would close both risks.

The product code is 29,892 lines, about €53,000 to rebuild.

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

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

If Production Readiness rose from 44 to 70, the lowest score rated Strong, the score would rise from 55 to about 63.

Code composition: what the lines of code are
Business logic 11%Supporting code 14%Tests 74%
New since the last survey: 11 findings

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

  • Code Duplication · Edited copy of a member (49 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs
  • Code Duplication · Edited copy of a member (22 corresponding lines) src/Rocksmith2014.SNG/Types/FingerPrint.fs
  • Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) src/Rocksmith2014.SNG/Types/Action.fs
  • Code Duplication · Edited copy of a member (14 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs
  • Code Duplication · Edited copy of a member (12 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs
  • Code Duplication · Edited copy of a member (58 corresponding lines) samples/DLCBuilder/Controls/FixedComboBox.fs
  • Code Coverage · CRAP 108: Note.WriteXml src/Rocksmith2014.XML/Note.cs
  • Code Coverage · CRAP 78: InstrumentalArrangement.ReadXml src/Rocksmith2014.XML/InstrumentalArrangement.cs
  • Code Coverage · CRAP 59: Note.ReadXml src/Rocksmith2014.XML/Note.cs
  • Code Coverage · CRAP 36: ChordTemplate.WriteXml src/Rocksmith2014.XML/ChordTemplate.cs
  • Domain vs controller coverage · Low domain coverage

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: 12 findings

These 12 critical or serious findings were in the previous survey, on 30 October 2026, and are gone from this one.

  • Code Coverage · CRAP 260: Note.WriteXml src/Rocksmith2014.XML/Note.cs
  • Code Coverage · CRAP 169: InstrumentalArrangement.ReadXml src/Rocksmith2014.XML/InstrumentalArrangement.cs
  • Code Coverage · CRAP 128: Note.ReadXml src/Rocksmith2014.XML/Note.cs
  • Code Coverage · CRAP 90: ChordTemplate.WriteXml src/Rocksmith2014.XML/ChordTemplate.cs
  • Code Coverage · CRAP 52: Chord.WriteXml src/Rocksmith2014.XML/Chord.cs
  • Code Coverage · CRAP 47: InstrumentalArrangement.FixHighDensity src/Rocksmith2014.XML/InstrumentalArrangement.cs
  • Code Coverage · CRAP 43: ChordTemplate.ReadXml src/Rocksmith2014.XML/ChordTemplate.cs
  • Secrets (history) · REDACTED: REDACTED samples/DLCBuilder.Domain/Tones/default_lead.json
  • Secrets (history) · REDACTED: REDACTED samples/DLCBuilder.Domain/Tones/tone_gear_data.json
  • Secrets (history) · REDACTED: REDACTED samples/DLCBuilder/ToneGearData.json
  • Secrets (history) · REDACTED: REDACTED samples/DLCBuilder/Tones/default_lead.json
  • Secrets (history) · REDACTED: REDACTED samples/DLCBuilder/pedalData.json
Rebuild cost: about €53,000 · Estimate
Cost to rebuild€18,000 to €89,000, for 293 to 935 hours of work, about 0.4 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 55. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 29,892 lines of product code
Comment linesThe estimate prices 28,819 lines. Comment lines count towards the size of 29,892 lines but aren't priced as work.
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 Documentation finding(s) in Documentation Quality — start with README.md.
Raises the score by about 6 points · Low effort · Documentation Quality
2
Resolve the 1 `ShowlightsXML` spells `XML` where 15 names in the project spell it… finding(s) in Naming Consistency — start with Attributes.fs.
Raises the score by about 5 points · Low effort · Naming Consistency
3
Automate the release in CI — a deploy stage for a service (Helm/Kubernetes manifests or an equivalent rollout), or a tag-triggered publish job for an artifact — so releases are repeatable and reversible.
Raises the score by about 6 points · Medium effort · Deployment & Rollback

Diagnosis: what the measurements show together

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

Where the investment is most exposed · Value at risk
This code would cost about €53,000 to build again, about 0.4 person-years of work. Its weakest lens is Production Readiness, at 44 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Documentation finding(s) in Documentation Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 Documentation 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

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 DLCBuilder DLCBuilder DLCBuilder.Domain Domain DLCBuilder->DLCBuilder.Domain Rocksmith2014.Audio Audio DLCBuilder->Rocksmith2014.Audio Rocksmith2014.DLCProject DLCProject DLCBuilder->Rocksmith2014.DLCProject Rocksmith2014.XML XML DLCBuilder->Rocksmith2014.XML Rocksmith2014.XML.Processing Processing DLCBuilder->Rocksmith2014.XML.Processing DLCBuilder.JapaneseLyricsCreator JapaneseLyricsCreator DLCBuilder.Domain->DLCBuilder.JapaneseLyricsCreator DLCBuilder.ToneCollection ToneCollection DLCBuilder.Domain->DLCBuilder.ToneCollection ProfileCleanerLib ProfileCleanerLib DLCBuilder.Domain->ProfileCleanerLib DLCBuilder.Domain->Rocksmith2014.Audio DLCBuilder.Domain->Rocksmith2014.DLCProject Rocksmith2014.EOF EOF DLCBuilder.Domain->Rocksmith2014.EOF Rocksmith2014.Common Common DLCBuilder.JapaneseLyricsCreator->Rocksmith2014.Common DLCBuilder.JapaneseLyricsCreator->Rocksmith2014.XML DLCBuilder.ToneCollection->Rocksmith2014.Common DLCBuilder.ToneCollection->Rocksmith2014.DLCProject EmptyTitleFix EmptyTitleFix EmptyTitleFix->Rocksmith2014.Common Rocksmith2014.PSARC PSARC EmptyTitleFix->Rocksmith2014.PSARC MiscTools MiscTools MiscTools->Rocksmith2014.Audio MiscTools->Rocksmith2014.DLCProject MiscTools->Rocksmith2014.EOF MiscTools->Rocksmith2014.XML.Processing ProfileCleanerLib->Rocksmith2014.Common ProfileCleanerLib->Rocksmith2014.PSARC Rocksmith2014.Audio->Rocksmith2014.Common Rocksmith2014.FSharpExtensions FSharpExtensions Rocksmith2014.Common->Rocksmith2014.FSharpExtensions Rocksmith2014.Conversion Conversion Rocksmith2014.Conversion->Rocksmith2014.Common Rocksmith2014.SNG SNG Rocksmith2014.Conversion->Rocksmith2014.SNG Rocksmith2014.Conversion->Rocksmith2014.XML Rocksmith2014.XML.Extension Extension Rocksmith2014.Conversion->Rocksmith2014.XML.Extension Rocksmith2014.DD DD Rocksmith2014.DD->Rocksmith2014.FSharpExtensions Rocksmith2014.DD->Rocksmith2014.XML Rocksmith2014.DD->Rocksmith2014.XML.Extension Rocksmith2014.DLCProject->Rocksmith2014.Conversion Rocksmith2014.DLCProject->Rocksmith2014.DD Rocksmith2014.DLCProject->Rocksmith2014.PSARC Rocksmith2014.DLCProject->Rocksmith2014.SNG Rocksmith2014.DLCProject->Rocksmith2014.XML Rocksmith2014.DLCProject->Rocksmith2014.XML.Processing Rocksmith2014.EOF->Rocksmith2014.FSharpExtensions Rocksmith2014.EOF->Rocksmith2014.XML Rocksmith2014.PSARC->Rocksmith2014.Common Rocksmith2014.SNG->Rocksmith2014.Common Rocksmith2014.XML.Extension->Rocksmith2014.XML Rocksmith2014.XML.Processing->Rocksmith2014.FSharpExtensions Rocksmith2014.XML.Processing->Rocksmith2014.XML Testing Testing Testing->Rocksmith2014.Conversion Testing->Rocksmith2014.DD Testing->Rocksmith2014.PSARC Testing->Rocksmith2014.SNG __more__ +4 more projects

Architecture: which parts of the code depend on which

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

135 modules, with 110 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; 95 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 Rocksmith2014.Common2 Rocksmith2014.Common.Manifest3 Rocksmith2014.DD.DataExtractor4 Rocksmith2014.DD.Types5 Rocksmith2014.DLCProject.ArrangementPropertiesOverride6 Rocksmith2014.EOF.ImportTypes7 Rocksmith2014.XML.Extension8 Rocksmith2014.XML.Processing.Types9 Rocksmith2014.DD.EntityChooser10 Rocksmith2014.DD.Generator11 Rocksmith2014.DD.LevelCounter12 Rocksmith2014.DD.NoteScorer13 Rocksmith2014.DD.PhraseCombiner14 Rocksmith2014.DLCProject15 Rocksmith2014.EOF.EOFTypes16 Rocksmith2014.PSARC17 Rocksmith2014.SNG18 BeatWriter19 EventConverter20 Rocksmith2014.Conversion21 Rocksmith2014.Conversion.ConvertInstrumental22 Rocksmith2014.Conversion.SngToXml23 Rocksmith2014.DLCProject.AggregateGraph24 Rocksmith2014.DLCProject.DLCProjectModule25 Rocksmith2014.DLCProject.GraphItemModule26 Rocksmith2014.DLCProject.Manifest.AttributesCreation27 Rocksmith2014.DLCProject.PackageBuilder28 Rocksmith2014.DLCProject.PhraseLevelComparer29 Rocksmith2014.DLCProject.PsarcImportTypes30 Rocksmith2014.DLCProject.PsarcImportUtils31 Rocksmith2014.DLCProject.XBlock32 Rocksmith2014.EOF.EOFProjectWriter33 Rocksmith2014.EOF.ProGuitarWriter34 Rocksmith2014.PSARC.Utils35 Rocksmith2014.SNG.SNGModule36 VocalsWriter37 Rocksmith2014.Conversion.ConvertVocals38 Rocksmith2014.Conversion.XmlToSng39 Rocksmith2014.Conversion.XmlToSngLevel40 Rocksmith2014.Conversion.XmlToSngNote
1 Rocksmith2014.Common
2 Rocksmith2014.Common.Manifest
3 Rocksmith2014.DD.DataExtractor
4 Rocksmith2014.DD.Types
5 Rocksmith2014.DLCProject.ArrangementPropertiesOverride
6 Rocksmith2014.EOF.ImportTypes
7 Rocksmith2014.XML.Extension
8 Rocksmith2014.XML.Processing.Types
9 Rocksmith2014.DD.EntityChooser11
10 Rocksmith2014.DD.Generator11
11 Rocksmith2014.DD.LevelCounter11
12 Rocksmith2014.DD.NoteScorer111
13 Rocksmith2014.DD.PhraseCombiner11
14 Rocksmith2014.DLCProject211
15 Rocksmith2014.EOF.EOFTypes2
16 Rocksmith2014.PSARC4
17 Rocksmith2014.SNG78
18 BeatWriter1
19 EventConverter1
20 Rocksmith2014.Conversion6
21 Rocksmith2014.Conversion.ConvertInstrumental121
22 Rocksmith2014.Conversion.SngToXml119
23 Rocksmith2014.DLCProject.AggregateGraph12
24 Rocksmith2014.DLCProject.DLCProjectModule3116
25 Rocksmith2014.DLCProject.GraphItemModule11
26 Rocksmith2014.DLCProject.Manifest.AttributesCreation653
27 Rocksmith2014.DLCProject.PackageBuilder41421
28 Rocksmith2014.DLCProject.PhraseLevelComparer11
29 Rocksmith2014.DLCProject.PsarcImportTypes11
30 Rocksmith2014.DLCProject.PsarcImportUtils2311
31 Rocksmith2014.DLCProject.XBlock11
32 Rocksmith2014.EOF.EOFProjectWriter12
33 Rocksmith2014.EOF.ProGuitarWriter13
34 Rocksmith2014.PSARC.Utils12
35 Rocksmith2014.SNG.SNGModule11
36 VocalsWriter11
37 Rocksmith2014.Conversion.ConvertVocals151
38 Rocksmith2014.Conversion.XmlToSng1191
39 Rocksmith2014.Conversion.XmlToSngLevel31
40 Rocksmith2014.Conversion.XmlToSngNote71
Uses a module listed above itPart of a loopThe module itself
1 Rocksmith2014.Common2 Rocksmith2014.Common.Manifest3 Rocksmith2014.DD.DataExtractor4 Rocksmith2014.DD.Types5 Rocksmith2014.DLCProject.ArrangementPropertiesOverride6 Rocksmith2014.EOF.ImportTypes7 Rocksmith2014.XML.Extension8 Rocksmith2014.XML.Processing.Types9 Rocksmith2014.DD.EntityChooser10 Rocksmith2014.DD.Generator11 Rocksmith2014.DD.LevelCounter12 Rocksmith2014.DD.NoteScorer13 Rocksmith2014.DD.PhraseCombiner14 Rocksmith2014.DLCProject15 Rocksmith2014.EOF.EOFTypes16 Rocksmith2014.PSARC17 Rocksmith2014.SNG18 BeatWriter19 EventConverter20 Rocksmith2014.Conversion21 Rocksmith2014.Conversion.ConvertInstrumental22 Rocksmith2014.Conversion.SngToXml23 Rocksmith2014.DLCProject.AggregateGraph24 Rocksmith2014.DLCProject.DLCProjectModule25 Rocksmith2014.DLCProject.GraphItemModule26 Rocksmith2014.DLCProject.Manifest.AttributesCreation27 Rocksmith2014.DLCProject.PackageBuilder28 Rocksmith2014.DLCProject.PhraseLevelComparer29 Rocksmith2014.DLCProject.PsarcImportTypes30 Rocksmith2014.DLCProject.PsarcImportUtils31 Rocksmith2014.DLCProject.XBlock32 Rocksmith2014.EOF.EOFProjectWriter33 Rocksmith2014.EOF.ProGuitarWriter34 Rocksmith2014.PSARC.Utils35 Rocksmith2014.SNG.SNGModule36 VocalsWriter37 Rocksmith2014.Conversion.ConvertVocals38 Rocksmith2014.Conversion.XmlToSng39 Rocksmith2014.Conversion.XmlToSngLevel40 Rocksmith2014.Conversion.XmlToSngNoteRocksmith2014.Common1Rocksmith2014.Common.Manifest2Rocksmith2014.DD.DataExtractor3Rocksmith2014.DD.Types4Rocksmith2014.DLCProject.ArrangementPropertiesOverride5Rocksmith2014.EOF.ImportTypes6Rocksmith2014.XML.Extension7Rocksmith2014.XML.Processing.Types8Rocksmith2014.DD.EntityChooser9Rocksmith2014.DD.Generator10Rocksmith2014.DD.LevelCounter11Rocksmith2014.DD.NoteScorer12Rocksmith2014.DD.PhraseCombiner13Rocksmith2014.DLCProject14Rocksmith2014.EOF.EOFTypes15Rocksmith2014.PSARC16Rocksmith2014.SNG17BeatWriter18EventConverter19Rocksmith2014.Conversion20Rocksmith2014.Conversion.ConvertInstrumental21Rocksmith2014.Conversion.SngToXml22Rocksmith2014.DLCProject.AggregateGraph23Rocksmith2014.DLCProject.DLCProjectModule24Rocksmith2014.DLCProject.GraphItemModule25Rocksmith2014.DLCProject.Manifest.AttributesCreation26Rocksmith2014.DLCProject.PackageBuilder27Rocksmith2014.DLCProject.PhraseLevelComparer28Rocksmith2014.DLCProject.PsarcImportTypes29Rocksmith2014.DLCProject.PsarcImportUtils30Rocksmith2014.DLCProject.XBlock31Rocksmith2014.EOF.EOFProjectWriter32Rocksmith2014.EOF.ProGuitarWriter33Rocksmith2014.PSARC.Utils34Rocksmith2014.SNG.SNGModule35VocalsWriter36Rocksmith2014.Conversion.ConvertVocals37Rocksmith2014.Conversion.XmlToSng38Rocksmith2014.Conversion.XmlToSngLevel39Rocksmith2014.Conversion.XmlToSngNote4011111111111211247811612111912311611653414211111231111121312111115111913171+95 more modules (most-connected shown)

At a glance — Code Health · 91% · Exemplary ·

At a glance — Architecture · 66% · Adequate · gated by D26, AX2 ·

At a glance — Maturity · 54% · Adequate · gated by M2 ·

At a glance — Readiness · 44% · Weak · gated by P3, P4, P9 ·

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

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection8High / Critical
A03:2025 — Software Supply Chain Failures8Medium
A07:2025 — Authentication Failures2High / Critical

Roadmap

Top priorities: Automate the release in CI — a deploy stage for a service (Helm/Kubernetes manifests or an equivalent rollout), or a tag-triggered publish job for an artifact — so releases are repeatable and reversible; Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md; 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.

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

Do thisHelpsEffortDimension
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md.+5.5 ptsLowDocumentation Quality
Resolve the 1 `ShowlightsXML` spells `XML` where 15 names in the project spell it… finding(s) in Naming Consistency — start with Attributes.fs.+4.7 ptsLowNaming Consistency
Automate the release in CI — a deploy stage for a service (Helm/Kubernetes manifests or an equivalent rollout), or a tag-triggered publish job for an artifact — so releases are repeatable and reversible.+5.7 ptsMediumDeployment & Rollback
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+4.9 ptsMediumArchitecture documentation
Raise unit-test coverage of the domain (aggregates, value objects, domain services) — that's where correctness matters most.+4.5 ptsMediumDomain vs controller coverage
Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Rocksmith2014.XML.csproj, Rocksmith2014.DD.Model.csproj.+1.8 ptsLowProject Cohesion
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.+2.3 ptsMediumDocumentation (README)
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.+2.2 ptsMediumStateful singletons

File quality

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

FileScoreBandWorst signal
REDACTED2.1SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.7SlopStatic Analysis (SAST): High: REDACTED
src/Rocksmith2014.Common/BinaryReaders.fs4.9MixedCode Duplication: Duplicated block (11 lines × 2)
src/Rocksmith2014.XML/Note.cs5.1MixedCyclomatic Complexity: Note.WriteXml (cyclomatic 46)
REDACTED5.7MixedSecrets (history): REDACTED: REDACTED
src/Rocksmith2014.XML/ShowLights.cs5.9MixedCode Duplication: Edited copy of a member (49 corresponding lines)
src/Rocksmith2014.XML/InstrumentalArrangement.cs6.0MixedExplicit Debt: HackComment
src/Rocksmith2014.XML/ChordTemplate.cs6.3MixedCyclomatic Complexity: ChordTemplate.WriteXml (cyclomatic 25)
src/Rocksmith2014.Conversion/XmlToSngNote.fs7.0MixedCyclomatic Complexity: XmlToSngNote.createMaskForNote (cyclomatic 25)
src/Rocksmith2014.Common/BinaryWriters.fs7.0MixedCode Duplication: Duplicated block (6 lines × 2)
src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs7.1MixedCyclomatic Complexity: InstrumentalChecker.checkNotes (cyclomatic 51)
src/Rocksmith2014.DLCProject/Manifest/Techniques.fs7.4MixedCyclomatic Complexity: Techniques.getTechniques (cyclomatic 49)
src/Rocksmith2014.XML.Processing/PhraseGenerator.fs7.4MixedCyclomatic Complexity: Helpers.findGoodPhraseTime (cyclomatic 23)
src/Rocksmith2014.XML/Chord.cs7.4MixedCyclomatic Complexity: Chord.WriteXml (cyclomatic 18)
samples/DLCBuilder/Modals/AbnormalExitMessage.fs7.4MixedCode Duplication: Members sharing a duplicated core (4 members, 50+ identical tokens)
src/Rocksmith2014.DD/EntityChooser.fs7.8MixedCyclomatic Complexity: EntityChooser.choose (cyclomatic 46)
src/Rocksmith2014.DLCProject/ArrangementPropertiesOverride.fs7.8MixedCyclomatic Complexity: ArrangementPropertiesOverride.fromArrangementProperties (cyclomatic 24)
src/Rocksmith2014.XML.Processing/Improvers/CustomEvents.fs7.8MixedCyclomatic Complexity: CustomEvents.improve (cyclomatic 19)
src/Rocksmith2014.DLCProject/Arrangement.fs7.8MixedCyclomatic Complexity: ArrangementModule.fromFile (cyclomatic 18)

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

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

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

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

Could not be resolved — 14

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 40 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, 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 — 40 dimensions across the health lenses
D1D2D3D4D5D6D8D10D13D14D15D17D19D21D26D27D28D29D34D35D36D43D44AX10AX2AX3AX4AX5AX8GD1M1M2M3P1P3P4P6P9PF3X5

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, 127 of 138 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 01a1de70-22c8-7cab-a89b-4224eb956e4b.

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

Run transparency — what happened this run

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

  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 23 test(s) behind this row are the ones the C# collector could read, and this repository also carries at least 94 test source file(s) (.fs) that it cannot: it parses C# syntax and matches C# test attributes, so a vitest/jest/JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT MEASURED: the test run produced no results for any test tier, so no test ever ran and flakiness could not be exercised. The cause could not be attributed, so it is excluded from the score rather than read as an absence of tests.
  • 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.
  • D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (4 contributor(s) across 2405 commit(s) sampled, automation and bot accounts excluded). One of them holds 100% of the history; the other 3 hold 0% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • 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/Rocksmith2014.SNG/Rocksmith2014.SNG.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 1 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (25,981 lines, 87% 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.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — 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.
  • D23 Boundary Type-Coupling — 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. Large codebase (29,892 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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 — 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.
  • AX6 Interface segregation — 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.
  • AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: a native UI project (samples/DLCBuilder/Styles.xaml). The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • 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'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.
  • X1 Async correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X2 Cancellation propagation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check'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.
  • X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X3 Exception handling — 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.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality 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.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • 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

18 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was InstrumentalChecker.checkNotes at 51. A further 5 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 Types.issueCode at 43 — they are counted neither in the figure above nor in this dimension's score. 3 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/Rocksmith2014.XML.Processing/Types.fs (Types.issueCode at 43), src/Rocksmith2014.DLCProject/Manifest/AttributesCreation.fs (AttributesCreation.getSectionUIName at 33), src/Rocksmith2014.DLCProject/StringValidator.fs (StringValidator.tryGetOfficialArtistNameSortValue at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

InstrumentalChecker.checkNotes (cyclomatic 51)src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:142
Techniques.getTechniques (cyclomatic 49)src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:103
Note.WriteXml (cyclomatic 46)src/Rocksmith2014.XML/Note.cs:534
EntityChooser.choose (cyclomatic 46)src/Rocksmith2014.DD/EntityChooser.fs:194
InstrumentalChecker.checkChords (cyclomatic 39)src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:329

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

What to do

  1. Bring the 18 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with InstrumentalChecker.checkNotes (cyclomatic 51), Techniques.getTechniques (cyclomatic 49), Note.WriteXml (cyclomatic 46). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 18 together lifts Cyclomatic Complexity from 7.3 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D2 · Cognitive Complexity5.7 / 10Adequate✓ 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 5.7 / 10 · rule-coverage 100% · ceiling Prevented

33 method(s) exceeded the cognitive complexity threshold of 15; the worst was Techniques.getTechniques at 89.

Techniques.getTechniques (cognitive 89)src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:103
EntityChooser.choose (cognitive 88)src/Rocksmith2014.DD/EntityChooser.fs:194
InstrumentalChecker.checkNotes (cognitive 85)src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:142
InstrumentalChecker.checkChords (cognitive 69)src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:329
XmlToSngNote.createMaskForNote (cognitive 61)src/Rocksmith2014.Conversion/XmlToSngNote.fs:55

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

What to do

  1. Bring the 33 bodies over 15 down to 15 or less in Cognitive Complexity — start with Techniques.getTechniques (cognitive 89), EntityChooser.choose (cognitive 88), InstrumentalChecker.checkNotes (cognitive 85). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 33 together lifts Cognitive Complexity from 5.7 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D3 · God Classes9.8 / 10Stronggated by 1 serious finding✓ 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 9.8 / 10 · rule-coverage 100% · ceiling Prevented

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

MethodTooLong: InstrumentalArrangement.ReadXmlsrc/Rocksmith2014.XML/InstrumentalArrangement.cs:403

What to do

  1. Resolve the 1 MethodTooLong finding(s) in God Classes — start with InstrumentalArrangement.cs. — One of this dimension's main actionable groups (1 warning-level).

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

D4 · Code Duplication8.9 / 10Strong✓ Tool-verified

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

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

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

34 duplicated block group(s) detected. 2.8 % of the production lines (844 of 29,892) are in a reported copy. A further 8 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 15 of the 42 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (5 lines × 2) · ×11src/Rocksmith2014.Common/BinaryWriters.fs:18
Duplicated block (9 lines × 2) · ×6src/Rocksmith2014.XML/Chord.cs:296
Duplicated block (6 lines × 2) · ×4src/Rocksmith2014.Common/BinaryReaders.fs:11
Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2src/Rocksmith2014.XML/BendValue.cs:1
Edited copy of a member (49 corresponding lines)src/Rocksmith2014.XML/ShowLights.cs:1

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

What to do

  1. Resolve the 11 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with BinaryWriters.fs (8), Cryptography.fs, Techniques.fs. — One of this dimension's main actionable groups (11 warning-level).
  2. Resolve the 6 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with InstrumentalDetails.fs (2), Chord.cs, AttributesCreation.fs. — One of this dimension's main actionable groups (6 warning-level).
  3. Resolve the 4 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with BinaryReaders.fs (3), BinaryWriters.fs. — One of this dimension's main actionable groups (4 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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.4 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

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

2 of 39 classes have LCOM4 above 3.

Low cohesion: LittleEndianBinaryReader (LCOM4 11) · ×2src/Rocksmith2014.Common/BinaryReaders.fs:10

What to do

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

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

D8 · Code Coverage9.8 / 10Stronggated by 11 serious findings✓ 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 9.8 / 10 · rule-coverage 100% · ceiling Verified

Line coverage 73.7% — 6 file(s) below 50% · 5 method(s) over the CRAP-30 risk line.

Low coverage: src/Rocksmith2014.XML/LinkedDiff.cs · ×6src/Rocksmith2014.XML/LinkedDiff.cs:1
CRAP 108: Note.WriteXmlsrc/Rocksmith2014.XML/Note.cs:534
CRAP 78: InstrumentalArrangement.ReadXmlsrc/Rocksmith2014.XML/InstrumentalArrangement.cs:403
CRAP 59: Note.ReadXmlsrc/Rocksmith2014.XML/Note.cs:432
CRAP 48: RSXmlComment.CommentType.getsrc/Rocksmith2014.XML/RSXmlComment.cs:55

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

What to do

  1. Resolve the 6 Low coverage finding(s) in Code Coverage — start with LinkedDiff.cs, NewLinkedDiff.cs, PhraseProperty.cs. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 1 CRAP 108 finding(s) in Code Coverage — start with Note.cs. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 CRAP 78 finding(s) in Code Coverage — start with InstrumentalArrangement.cs. — One of this dimension's main actionable groups (1 warning-level).

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

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 23 tests. Measured on the C# suite only — at least 94 test source file(s) (.fs) went unread, so its test quality is unmeasured and is not in these counts.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

D13 · REDACTED 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

REDACTED 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 198 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 34 direct `PackageReference`(s), and 164 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 Hotspots10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

1 deducted debt markers + unmeasured dead symbols across 3953 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 (87% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).

HackCommentsrc/Rocksmith2014.XML/InstrumentalArrangement.cs:267

What to do

  1. Resolve the 1 HackComment finding(s) in Explicit Debt — start with InstrumentalArrangement.cs. — One of this dimension's main actionable groups (1 warning-level).

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

D19 · Documentation Quality0.0 / 10Critical✓ Tool-verified

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

0 of 1 documentation facets pass in full; short on: F2 example. 1 document(s) read across 3 unit(s).

Documentation: no build, run or usage exampleREADME.md:1

What to do

  1. Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

`ShowlightsXML` spells `XML` where 15 names in the project spell it `Xml`src/Rocksmith2014.Common/Manifest/Attributes.fs:109

What to do

  1. Resolve the 1 `ShowlightsXML` spells `XML` where 15 names in the project spell it… finding(s) in Naming Consistency — start with Attributes.fs. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

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

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

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

2 of 3 projects flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×2src/Rocksmith2014.XML/Rocksmith2014.XML.csproj:1

What to do

  1. Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Rocksmith2014.XML.csproj, Rocksmith2014.DD.Model.csproj. — One of this dimension's main actionable groups (2 recommendation-level).

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

D27 · Navigability6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

94 % of calls cross a namespace and 2 % go through an interface, but 17 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.

Scattered collaborators

What to do

  1. Resolve the 1 Scattered collaborators finding(s) in Navigability. — One of this dimension's main actionable groups (1 recommendation-level).

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

D28 · Secrets (history)9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

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

D29 · Static Analysis (SAST)9.0 / 10Adequategated by 6 critical findings✓ Tool-verified

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

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

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

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

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

What to do

  1. Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
  2. No action in Static Analysis (SAST) — all 6 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 (6 issue-level, 0 of them charged here).

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

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

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

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

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

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

AX2 · Stateful singletons1.0 / 10Critical✓ Tool-verified

Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.

Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.

  • `InstrumentalArrangement` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (UseAbridgedXml; e.g. `UseAbridgedXml` at line 111). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — src/Rocksmith2014.XML/InstrumentalArrangement.cs:16

What to do

  • A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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.

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

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

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

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

  • 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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:6
  • `Directory.Packages.props` 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`. — Directory.Packages.props:6

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 & Rollback2.0 / 10Critical✓ 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.

  • No release automation was found in CI — neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse.

What to do

  • Automate the release in CI — a deploy stage for a service (Helm/Kubernetes manifests or an equivalent rollout), or a tag-triggered publish job for an artifact — so releases are repeatable and reversible.
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.

P9 · Domain vs controller coverage4.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether test coverage concentrates on the domain (business rules) rather than the trivial web/controller layer — a focus check a generic tool can't make.

Method: Roslyn plus test-execution analysis: domain-layer versus trivial web/controller coverage ratio. Computed metric, deterministic.

  • Domain coverage is 33%, against a bar of 50% for this row — the layer carrying the business rules is the least covered part of the codebase that matters most. Measured over the types this analyzer classifies as domain (aggregates, value objects, domain services), so code the classifier does not place in the domain is neither counted for nor against this figure.

What to do

  • Raise unit-test coverage of the domain (aggregates, value objects, domain services) — that's where correctness matters most.
PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

X5 · Nullable reference types10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.

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

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 Health91%ExemplarySolid.
Architecture66%Adequate — gated by D26, AX2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity54%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness44%Weak — gated by P3, P4, P9Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security70%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100%ExemplaryStrongest area.
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 — 76 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
  • AX6 Interface segregation — AX6 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.
  • D11 Test Reliability — Test reliability not measured — no test run produced results
  • D12 Dependency Hygiene — Dependency hygiene not measured
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • 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.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
  • 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
  • D30 Dependency Vulnerabilities — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
  • 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 — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 107 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one; a Domain/Aggregates/ValueObjects layer; a domain structure with no aggregate, domain event or strongly-typed id in it: a CRUD / clean-architecture model, measured but not claimed as DDD; a top-level samples/ tree: a library or framework whose examples are its consumers — these types are building blocks, not a domain
  • 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 — IC1 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P2 Observability — This repository's F# source (11 module(s), 155 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
  • P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
  • P8 Schema migrations — no EF Core usage detected
  • 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.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X1 Async correctness — X1 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — X12 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — X16 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — X18 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — X2 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — X27 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — X29 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X3 Exception handling — X3 reached only 13% of this repository's production lines — fsharp (26,039 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 7 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D28 · Secrets (history) · REDACTED · ×1
  • REDACTED
Serious — 117 finding(s)
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×11
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:18 — src/Rocksmith2014.Common/BinaryWriters.fs:18-22 | src/Rocksmith2014.Common/BinaryWriters.fs:78-82 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:24 — src/Rocksmith2014.Common/BinaryWriters.fs:24-28 | src/Rocksmith2014.Common/BinaryWriters.fs:84-88 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:30 — src/Rocksmith2014.Common/BinaryWriters.fs:30-34 | src/Rocksmith2014.Common/BinaryWriters.fs:90-94 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:36 — src/Rocksmith2014.Common/BinaryWriters.fs:36-40 | src/Rocksmith2014.Common/BinaryWriters.fs:96-100 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:42 — src/Rocksmith2014.Common/BinaryWriters.fs:42-46 | src/Rocksmith2014.Common/BinaryWriters.fs:102-106 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:48 — src/Rocksmith2014.Common/BinaryWriters.fs:48-52 | src/Rocksmith2014.Common/BinaryWriters.fs:108-112 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:54 — src/Rocksmith2014.Common/BinaryWriters.fs:54-58 | src/Rocksmith2014.Common/BinaryWriters.fs:114-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.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:60 — src/Rocksmith2014.Common/BinaryWriters.fs:60-64 | src/Rocksmith2014.Common/BinaryWriters.fs:120-124 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.SNG/Cryptography.fs:38 — src/Rocksmith2014.SNG/Cryptography.fs:38-42 | src/Rocksmith2014.SNG/Cryptography.fs:67-71 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:9 — src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:9-13 | src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:63-67 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) samples/DLCBuilder/Controls/FixedComboBox.fs:39 — samples/DLCBuilder/Controls/FixedComboBox.fs:39-43 | samples/DLCBuilder/Controls/FixedSlider.fs:38-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×6
  • Duplicated block (9 lines × 2) src/Rocksmith2014.XML/Chord.cs:296 — src/Rocksmith2014.XML/Chord.cs:296-304 | src/Rocksmith2014.XML/Note.cs:545-553 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9 lines × 2) src/Rocksmith2014.DLCProject/Manifest/AttributesCreation.fs:255 — src/Rocksmith2014.DLCProject/Manifest/AttributesCreation.fs:255-263 | src/Rocksmith2014.DLCProject/Manifest/AttributesCreation.fs:286-294 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) src/Rocksmith2014.Conversion/XmlToSngNote.fs:39 — src/Rocksmith2014.Conversion/XmlToSngNote.fs:39-47 | src/Rocksmith2014.Conversion/XmlToSngNote.fs:72-80 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) samples/DLCBuilder/Views/InstrumentalDetails.fs:300 — samples/DLCBuilder/Views/InstrumentalDetails.fs:300-308 | samples/DLCBuilder/Views/VocalsDetails.fs:40-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Views/InstrumentalDetails.fs:300` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) samples/DLCBuilder/Views/InstrumentalDetails.fs:325 — samples/DLCBuilder/Views/InstrumentalDetails.fs:325-333 | samples/DLCBuilder/Views/VocalsDetails.fs:65-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Views/InstrumentalDetails.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.
  • Duplicated block (9 lines × 2) samples/Testing/Program.fs:64 — samples/Testing/Program.fs:64-72 | samples/Testing/Program.fs:89-99 — 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 `samples/Testing/Program.fs:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D8 · Code Coverage · Low coverage · ×6
  • Low coverage: src/Rocksmith2014.XML/LinkedDiff.cs src/Rocksmith2014.XML/LinkedDiff.cs:1 — 0.0% line coverage (0/17).
  • Low coverage: src/Rocksmith2014.XML/NewLinkedDiff.cs src/Rocksmith2014.XML/NewLinkedDiff.cs:1 — 15.9% line coverage (7/44).
  • Low coverage: src/Rocksmith2014.XML/PhraseProperty.cs src/Rocksmith2014.XML/PhraseProperty.cs:1 — 23.8% line coverage (5/21).
  • Low coverage: src/Rocksmith2014.XML/RSXmlComment.cs src/Rocksmith2014.XML/RSXmlComment.cs:1 — 5.6% line coverage (1/18).
  • Low coverage: src/Rocksmith2014.XML/ShowLight.cs src/Rocksmith2014.XML/ShowLight.cs:1 — 48.1% line coverage (13/27).
  • Low coverage: src/Rocksmith2014.XML/ShowLights.cs src/Rocksmith2014.XML/ShowLights.cs:1 — 45.5% line coverage (10/22).
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×4
  • Duplicated block (6 lines × 2) src/Rocksmith2014.Common/BinaryReaders.fs:11 — src/Rocksmith2014.Common/BinaryReaders.fs:11-16 | src/Rocksmith2014.Common/BinaryReaders.fs:85-90 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) src/Rocksmith2014.Common/BinaryWriters.fs:11 — src/Rocksmith2014.Common/BinaryWriters.fs:11-16 | src/Rocksmith2014.Common/BinaryWriters.fs:71-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) src/Rocksmith2014.Common/BinaryReaders.fs:26 — src/Rocksmith2014.Common/BinaryReaders.fs:26-31 | src/Rocksmith2014.Common/BinaryReaders.fs:100-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) src/Rocksmith2014.Common/BinaryReaders.fs:46 — src/Rocksmith2014.Common/BinaryReaders.fs:46-51 | src/Rocksmith2014.Common/BinaryReaders.fs:120-125 — 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) src/Rocksmith2014.XML/BendValue.cs:1 — src/Rocksmith2014.XML/BendValue.cs:1-90 | src/Rocksmith2014.XML/Ebeat.cs:1-118 | src/Rocksmith2014.XML/ShowLight.cs:1-96 | src/Rocksmith2014.XML/Vocal.cs:1-106 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) samples/DLCBuilder/Modals/AbnormalExitMessage.fs:1 — samples/DLCBuilder/Modals/AbnormalExitMessage.fs:1-60 | samples/DLCBuilder/Modals/DeleteConfirmation.fs:1-74 | samples/DLCBuilder/Modals/ExitConfirmation.fs:1-69 | samples/DLCBuilder/Modals/IdRegenerationConfirmation.fs:1-96 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: LittleEndianBinaryReader (LCOM4 11) src/Rocksmith2014.Common/BinaryReaders.fs:10 — LittleEndianBinaryReader's methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: BigEndianBinaryReader (LCOM4 11) src/Rocksmith2014.Common/BinaryReaders.fs:84 — BigEndianBinaryReader's methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
AX2 · Stateful singletons · Process-global static state · ×1
  • Process-global static state: InstrumentalArrangement src/Rocksmith2014.XML/InstrumentalArrangement.cs:16 — `InstrumentalArrangement` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (UseAbridgedXml; e.g. `UseAbridgedXml` at line 111). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
D1 · Cyclomatic Complexity · InstrumentalChecker.checkNotes (cyclomatic 51) · ×1
  • InstrumentalChecker.checkNotes (cyclomatic 51) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:142 — InstrumentalChecker.checkNotes has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Techniques.getTechniques (cyclomatic 49) · ×1
  • Techniques.getTechniques (cyclomatic 49) src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:103 — Techniques.getTechniques has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent 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 · Note.WriteXml (cyclomatic 46) · ×1
  • Note.WriteXml (cyclomatic 46) src/Rocksmith2014.XML/Note.cs:534 — Note.WriteXml has cyclomatic complexity 46 (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 · EntityChooser.choose (cyclomatic 46) · ×1
  • EntityChooser.choose (cyclomatic 46) src/Rocksmith2014.DD/EntityChooser.fs:194 — EntityChooser.choose has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · InstrumentalChecker.checkChords (cyclomatic 39) · ×1
  • InstrumentalChecker.checkChords (cyclomatic 39) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:329 — InstrumentalChecker.checkChords has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Note.ReadXml (cyclomatic 31) · ×1
  • Note.ReadXml (cyclomatic 31) src/Rocksmith2014.XML/Note.cs:432 — Note.ReadXml has cyclomatic complexity 31 (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 · ChordTemplate.WriteXml (cyclomatic 25) · ×1
  • ChordTemplate.WriteXml (cyclomatic 25) src/Rocksmith2014.XML/ChordTemplate.cs:185 — ChordTemplate.WriteXml has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · XmlToSngNote.createMaskForNote (cyclomatic 25) · ×1
  • XmlToSngNote.createMaskForNote (cyclomatic 25) src/Rocksmith2014.Conversion/XmlToSngNote.fs:55 — XmlToSngNote.createMaskForNote has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ArrangementPropertiesOverride.fromArrangementProperties (cyclomatic 24) · ×1
  • ArrangementPropertiesOverride.fromArrangementProperties (cyclomatic 24) src/Rocksmith2014.DLCProject/ArrangementPropertiesOverride.fs:36 — ArrangementPropertiesOverride.fromArrangementProperties has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · MetaData.Read (cyclomatic 23) · ×1
  • MetaData.Read (cyclomatic 23) src/Rocksmith2014.XML/MetaData.cs:108 — MetaData.Read has cyclomatic complexity 23 (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 · Helpers.findGoodPhraseTime (cyclomatic 23) · ×1
  • Helpers.findGoodPhraseTime (cyclomatic 23) src/Rocksmith2014.XML.Processing/PhraseGenerator.fs:147 — Helpers.findGoodPhraseTime has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · XmlToSngNote.createMaskForChordNote (cyclomatic 20) · ×1
  • XmlToSngNote.createMaskForChordNote (cyclomatic 20) src/Rocksmith2014.Conversion/XmlToSngNote.fs:24 — XmlToSngNote.createMaskForChordNote has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CustomEvents.improve (cyclomatic 19) · ×1
  • CustomEvents.improve (cyclomatic 19) src/Rocksmith2014.XML.Processing/Improvers/CustomEvents.fs:9 — CustomEvents.improve has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Chord.WriteXml (cyclomatic 18) · ×1
  • Chord.WriteXml (cyclomatic 18) src/Rocksmith2014.XML/Chord.cs:291 — Chord.WriteXml has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · InstrumentalArrangement.FixHighDensity (cyclomatic 18) · ×1
  • InstrumentalArrangement.FixHighDensity (cyclomatic 18) src/Rocksmith2014.XML/InstrumentalArrangement.cs:200 — InstrumentalArrangement.FixHighDensity has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: InstrumentalArrangement.ReadXml (cyclomatic 38) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · ArrangementModule.fromFile (cyclomatic 18) · ×1
  • ArrangementModule.fromFile (cyclomatic 18) src/Rocksmith2014.DLCProject/Arrangement.fs:187 — ArrangementModule.fromFile has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · XmlToSngNote.convertNote (cyclomatic 18) · ×1
  • XmlToSngNote.convertNote (cyclomatic 18) src/Rocksmith2014.Conversion/XmlToSngNote.fs:184 — XmlToSngNote.convertNote has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ProGuitarWriter.writeProTrack (cyclomatic 18) · ×1
  • ProGuitarWriter.writeProTrack (cyclomatic 18) src/Rocksmith2014.EOF/ProGuitarWriter.fs:102 — ProGuitarWriter.writeProTrack has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D17 · Explicit Debt · HackComment · ×1
  • HackComment src/Rocksmith2014.XML/InstrumentalArrangement.cs:267 — // Hack for Toolkit-like behavior, where repeated chords inside the hand shape will be forced to strums. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D2 · Cognitive Complexity · Techniques.getTechniques (cognitive 89) · ×1
  • Techniques.getTechniques (cognitive 89) src/Rocksmith2014.DLCProject/Manifest/Techniques.fs:103 — Techniques.getTechniques has cognitive complexity 89 (threshold 15). Drivers by points: if/else 43 (84 pts), boolean chains 5 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EntityChooser.choose (cognitive 88) · ×1
  • EntityChooser.choose (cognitive 88) src/Rocksmith2014.DD/EntityChooser.fs:194 — EntityChooser.choose has cognitive complexity 88 (threshold 15). Drivers by points: if/else 17 (56 pts), boolean chains 12, match/switch 5 (11 pts), loops 2 (9 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · InstrumentalChecker.checkNotes (cognitive 85) · ×1
  • InstrumentalChecker.checkNotes (cognitive 85) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:142 — InstrumentalChecker.checkNotes has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (57 pts), match/switch 5 (15 pts), boolean chains 12, loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InstrumentalChecker.checkChords (cognitive 69) · ×1
  • InstrumentalChecker.checkChords (cognitive 69) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:329 — InstrumentalChecker.checkChords has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (48 pts), boolean chains 13, match/switch 2 (7 pts), loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · XmlToSngNote.createMaskForNote (cognitive 61) · ×1
  • XmlToSngNote.createMaskForNote (cognitive 61) src/Rocksmith2014.Conversion/XmlToSngNote.fs:55 — XmlToSngNote.createMaskForNote has cognitive complexity 61 (threshold 15). Drivers by points: if/else 48 (61 pts) (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Helpers.findGoodPhraseTime (cognitive 55) · ×1
  • Helpers.findGoodPhraseTime (cognitive 55) src/Rocksmith2014.XML.Processing/PhraseGenerator.fs:147 — Helpers.findGoodPhraseTime has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 7 (27 pts), if/else 12 (24 pts), boolean chains 4 (nesting depth added 32). 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 · XmlToSngNote.createMaskForChordNote (cognitive 49) · ×1
  • XmlToSngNote.createMaskForChordNote (cognitive 49) src/Rocksmith2014.Conversion/XmlToSngNote.fs:24 — XmlToSngNote.createMaskForChordNote has cognitive complexity 49 (threshold 15). Drivers by points: if/else 38 (49 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Note.WriteXml (cognitive 45) · ×1
  • Note.WriteXml (cognitive 45) src/Rocksmith2014.XML/Note.cs:534 — Note.WriteXml has cognitive complexity 45 (threshold 15). 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 · InstrumentalArrangement.FixHighDensity (cognitive 43) · ×1
  • InstrumentalArrangement.FixHighDensity (cognitive 43) src/Rocksmith2014.XML/InstrumentalArrangement.cs:200 — InstrumentalArrangement.FixHighDensity has cognitive complexity 43 (threshold 15). Of this number, 36 points are the body's own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SngToXml.convertNoteMask (cognitive 41) · ×1
  • SngToXml.convertNoteMask (cognitive 41) src/Rocksmith2014.Conversion/SngToXml.fs:112 — SngToXml.convertNoteMask has cognitive complexity 41 (threshold 15). Drivers by points: if/else 28 (41 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · XmlToSngNote.convertNote (cognitive 35) · ×1
  • XmlToSngNote.convertNote (cognitive 35) src/Rocksmith2014.Conversion/XmlToSngNote.fs:184 — XmlToSngNote.convertNote has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BasicFixes.fixLinkNexts (cognitive 35) · ×1
  • BasicFixes.fixLinkNexts (cognitive 35) src/Rocksmith2014.XML.Processing/Improvers/BasicFixes.fs:42 — BasicFixes.fixLinkNexts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (31 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · XmlToSngNote.createMaskForChord (cognitive 32) · ×1
  • XmlToSngNote.createMaskForChord (cognitive 32) src/Rocksmith2014.Conversion/XmlToSngNote.fs:90 — XmlToSngNote.createMaskForChord has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26 (32 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · CustomEvents.improve (cognitive 29) · ×1
  • CustomEvents.improve (cognitive 29) src/Rocksmith2014.XML.Processing/Improvers/CustomEvents.fs:9 — CustomEvents.improve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 4 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArrangementModule.fromFile (cognitive 27) · ×1
  • ArrangementModule.fromFile (cognitive 27) src/Rocksmith2014.DLCProject/Arrangement.fs:187 — ArrangementModule.fromFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (6 pts), error handling 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UnncessaryNoteRemover.improve (cognitive 27) · ×1
  • UnncessaryNoteRemover.improve (cognitive 27) src/Rocksmith2014.XML.Processing/Improvers/UnnecessaryNoteRemover.fs:6 — UnncessaryNoteRemover.improve has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 3 (13 pts), loops 4 (7 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ChordTemplate.WriteXml (cognitive 24) · ×1
  • ChordTemplate.WriteXml (cognitive 24) src/Rocksmith2014.XML/ChordTemplate.cs:185 — ChordTemplate.WriteXml has cognitive complexity 24 (threshold 15). 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 · Helpers.createPhrasesAndSections (cognitive 24) · ×1
  • Helpers.createPhrasesAndSections (cognitive 24) src/Rocksmith2014.XML.Processing/PhraseGenerator.fs:230 — Helpers.createPhrasesAndSections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArrangementPropertiesOverride.fromArrangementProperties (cognitive 23) · ×1
  • ArrangementPropertiesOverride.fromArrangementProperties (cognitive 23) src/Rocksmith2014.DLCProject/ArrangementPropertiesOverride.fs:36 — ArrangementPropertiesOverride.fromArrangementProperties has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23. 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 · HandShapeAdjuster.shortenHandshapes (cognitive 23) · ×1
  • HandShapeAdjuster.shortenHandshapes (cognitive 23) src/Rocksmith2014.XML.Processing/Improvers/HandShapeAdjuster.fs:90 — HandShapeAdjuster.shortenHandshapes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InstrumentalChecker.checkLinkNext (cognitive 22) · ×1
  • InstrumentalChecker.checkLinkNext (cognitive 22) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:72 — InstrumentalChecker.checkLinkNext has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SngToXml.convertChordMask (cognitive 20) · ×1
  • SngToXml.convertChordMask (cognitive 20) src/Rocksmith2014.Conversion/SngToXml.fs:160 — SngToXml.convertChordMask has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ProGuitarWriter.writeProTrack (cognitive 20) · ×1
  • ProGuitarWriter.writeProTrack (cognitive 20) src/Rocksmith2014.EOF/ProGuitarWriter.fs:102 — ProGuitarWriter.writeProTrack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Chord.WriteXml (cognitive 18) · ×1
  • Chord.WriteXml (cognitive 18) src/Rocksmith2014.XML/Chord.cs:291 — Chord.WriteXml has cognitive complexity 18 (threshold 15). 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 · HandShapeAdjuster.lengthenHandshapes (cognitive 18) · ×1
  • HandShapeAdjuster.lengthenHandshapes (cognitive 18) src/Rocksmith2014.XML.Processing/Improvers/HandShapeAdjuster.fs:29 — HandShapeAdjuster.lengthenHandshapes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EOFFixes.fixPhraseStartAnchors (cognitive 18) · ×1
  • EOFFixes.fixPhraseStartAnchors (cognitive 18) src/Rocksmith2014.XML.Processing/Improvers/EOFFixes.fs:61 — EOFFixes.fixPhraseStartAnchors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TechNotes.combineTechNotes (cognitive 18) · ×1
  • TechNotes.combineTechNotes (cognitive 18) src/Rocksmith2014.EOF/TechNotes.fs:41 — TechNotes.combineTechNotes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · InstrumentalArrangement.RemoveDD (cognitive 17) · ×1
  • InstrumentalArrangement.RemoveDD (cognitive 17) src/Rocksmith2014.XML/InstrumentalArrangement.cs:335 — InstrumentalArrangement.RemoveDD has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Generator.generateLevels (cognitive 17) · ×1
  • Generator.generateLevels (cognitive 17) src/Rocksmith2014.DD/Generator.fs:6 — Generator.generateLevels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AudioFader.NAudio.Wave.ISampleProvider.Read (cognitive 16) · ×1
  • AudioFader.NAudio.Wave.ISampleProvider.Read (cognitive 16) src/Rocksmith2014.Audio/AudioFader.fs:16 — AudioFader.NAudio.Wave.ISampleProvider.Read has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ToneModule.getPedal (cognitive 16) · ×1
  • ToneModule.getPedal (cognitive 16) REDACTED:102 — ToneModule.getPedal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PhraseCombiner.combineSamePhrases (cognitive 16) · ×1
  • PhraseCombiner.combineSamePhrases (cognitive 16) src/Rocksmith2014.DD/PhraseCombiner.fs:95 — PhraseCombiner.combineSamePhrases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · InstrumentalChecker.checkPhrases (cognitive 16) · ×1
  • InstrumentalChecker.checkPhrases (cognitive 16) src/Rocksmith2014.XML.Processing/Checkers/InstrumentalChecker.fs:528 — InstrumentalChecker.checkPhrases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D3 · God Classes · MethodTooLong · ×1
  • MethodTooLong: InstrumentalArrangement.ReadXml src/Rocksmith2014.XML/InstrumentalArrangement.cs:403 — MethodTooLong — ReadXml runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (49 corresponding lines) · ×1
  • Edited copy of a member (49 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs:1 — src/Rocksmith2014.XML/ShowLights.cs:1-49 | src/Rocksmith2014.XML/Vocals.cs:1-49 — These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) src/Rocksmith2014.SNG/Types/FingerPrint.fs:1 — src/Rocksmith2014.SNG/Types/FingerPrint.fs:1-26 | src/Rocksmith2014.SNG/Types/PhraseIteration.fs:1-22 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 18+ corresponding lines) src/Rocksmith2014.SNG/Types/Action.fs:1 — src/Rocksmith2014.SNG/Types/Action.fs:1-18 | src/Rocksmith2014.SNG/Types/Event.fs:1-19 | src/Rocksmith2014.SNG/Types/Tone.fs:1-18 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs:37 — src/Rocksmith2014.XML/ShowLights.cs:37-50 | src/Rocksmith2014.XML/Vocals.cs:37-50 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) src/Rocksmith2014.XML/ShowLights.cs:18 — src/Rocksmith2014.XML/ShowLights.cs:18-29 | src/Rocksmith2014.XML/Vocals.cs:18-29 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (25–28 lines × 2) · ×1
  • Duplicated block (25–28 lines × 2) src/Rocksmith2014.DLCProject/DLCProject.fs:252 — src/Rocksmith2014.DLCProject/DLCProject.fs:252-276 | src/Rocksmith2014.DLCProject/DLCProject.fs:288-315 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (17–19 lines × 2) · ×1
  • Duplicated block (17–19 lines × 2) src/Rocksmith2014.DLCProject/SoundBank/SoundBank.fs:126 — src/Rocksmith2014.DLCProject/SoundBank/SoundBank.fs:126-144 | src/Rocksmith2014.DLCProject/SoundBank/SoundBank.fs:190-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (15 lines × 4) · ×1
  • Duplicated block (15 lines × 4) src/Rocksmith2014.XML/BendValue.cs:38 — src/Rocksmith2014.XML/BendValue.cs:38-52 | src/Rocksmith2014.XML/Ebeat.cs:50-64 | src/Rocksmith2014.XML/ShowLight.cs:66-80 | src/Rocksmith2014.XML/Vocal.cs:68-82 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/Rocksmith2014.XML/BendValue.cs:38` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/Rocksmith2014.XML/ShowLight.cs:55` calls `IsBeam`, `IsFog` and `src/Rocksmith2014.XML/BendValue.cs:33` 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 (11 lines × 2) · ×1
  • Duplicated block (11 lines × 2) src/Rocksmith2014.Common/BinaryReaders.fs:72 — src/Rocksmith2014.Common/BinaryReaders.fs:72-82 | src/Rocksmith2014.Common/BinaryReaders.fs:146-156 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Edited copy of a member (58 corresponding lines) · ×1
  • Edited copy of a member (58 corresponding lines) samples/DLCBuilder/Controls/FixedComboBox.fs:2 — samples/DLCBuilder/Controls/FixedComboBox.fs:2-74 | samples/DLCBuilder/Controls/FixedSlider.fs:2-59 — These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) samples/DLCBuilder.Domain/Utils.fs:40 — samples/DLCBuilder.Domain/Utils.fs:40-59 | samples/ToneCollector/Program.fs:34-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) samples/DLCBuilder/Modals/AbnormalExitMessage.fs:3 — samples/DLCBuilder/Modals/AbnormalExitMessage.fs:3-21 | samples/DLCBuilder/Modals/ExitConfirmation.fs:3-21 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Modals/AbnormalExitMessage.fs:3` 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 lines × 2) · ×1
  • Duplicated block (16 lines × 2) samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:33 — samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:33-48 | samples/DLCBuilder/Controls/FixedTextBox.fs:50-65 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:33` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×1
  • Duplicated block (13 lines × 4) samples/DLCBuilder/Modals/AbnormalExitMessage.fs:12 — samples/DLCBuilder/Modals/AbnormalExitMessage.fs:12-24 | samples/DLCBuilder/Modals/DeleteConfirmation.fs:13-25 | samples/DLCBuilder/Modals/ExitConfirmation.fs:12-24 | samples/DLCBuilder/Modals/IdRegenerationConfirmation.fs:24-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Modals/AbnormalExitMessage.fs:12` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9–11 lines × 2) · ×1
  • Duplicated block (9–11 lines × 2) samples/Testing/Program.fs:41 — samples/Testing/Program.fs:41-49 | samples/Testing/Program.fs:96-106 — 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 `samples/Testing/Program.fs:41` 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 (8–9 lines × 2) · ×1
  • Duplicated block (8–9 lines × 2) samples/DLCBuilder/Controls/FuncUIExtensions.fs:17 — samples/DLCBuilder/Controls/FuncUIExtensions.fs:17-24 | samples/MiscTools/Tools.fs:26-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) samples/DLCBuilder.ToneCollection/Database.fs:107 — samples/DLCBuilder.ToneCollection/Database.fs:107-113 | samples/DLCBuilder.ToneCollection/Database.fs:134-141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:51 — samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:51-58 | samples/DLCBuilder/Controls/FixedTextBox.fs:68-76 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `samples/DLCBuilder/Controls/FixedAutoCompleteBox.fs:51` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) samples/DLCBuilder/Views/Main.fs:153 — samples/DLCBuilder/Views/Main.fs:153-166 | samples/DLCBuilder/Views/Main.fs:227-240 — 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 `samples/DLCBuilder/Views/Main.fs:153` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D8 · Code Coverage · CRAP 108 · ×1
  • CRAP 108: Note.WriteXml src/Rocksmith2014.XML/Note.cs:534 — Cyclomatic 46 with 69.2% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
D8 · Code Coverage · CRAP 78 · ×1
  • CRAP 78: InstrumentalArrangement.ReadXml src/Rocksmith2014.XML/InstrumentalArrangement.cs:403 — Cyclomatic 38 with 69.9% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
D8 · Code Coverage · CRAP 59 · ×1
  • CRAP 59: Note.ReadXml src/Rocksmith2014.XML/Note.cs:432 — Cyclomatic 31 with 69.2% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
D8 · Code Coverage · CRAP 48 · ×1
  • CRAP 48: RSXmlComment.CommentType.get src/Rocksmith2014.XML/RSXmlComment.cs:55 — Cyclomatic 7 with 5.6% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
D8 · Code Coverage · CRAP 36 · ×1
  • CRAP 36: ChordTemplate.WriteXml src/Rocksmith2014.XML/ChordTemplate.cs:185 — Cyclomatic 25 with 74.2% file coverage — too complex for how untested it is (CRAP = CC²·(1−cov)³ + CC; ≥30 needs tests or simplification).
P4 · Deployment & Rollback · No deployment automation · ×1
  • No deployment automation — No release automation was found in CI — neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse.
P9 · Domain vs controller coverage · Low domain coverage · ×1
  • Low domain coverage — Domain coverage is 33%, against a bar of 50% for this row — the layer carrying the business rules is the least covered part of the codebase that matters most. Measured over the types this analyzer classifies as domain (aggregates, value objects, domain services), so code the classifier does not place in the domain is neither counted for nor against this figure.
Minor — 14 finding(s)
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×2
  • Projects may be oversized for their cohesion src/Rocksmith2014.XML/Rocksmith2014.XML.csproj:1 — `Rocksmith2014.XML` overshoots its size bounds (3853 LoC, 551 public types across 296 namespaces). 2 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion — draw the boundary inside the assembly first (group each responsibility into its own namespace/folder and keep the cross-boundary members internal), since splitting a published assembly moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion src/Rocksmith2014.DD.Model/Rocksmith2014.DD.Model.csproj:1 — `Rocksmith2014.DD.Model` overshoots its size bounds (100 LoC, 551 public types across 296 namespaces). 2 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion — draw the boundary inside the assembly first (group each responsibility into its own namespace/folder and keep the cross-boundary members internal), since splitting a published assembly moves types between packages and breaks consumers.
D19 · Documentation Quality · Documentation · ×1
  • Documentation: no build, run or usage example README.md:1 — the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D21 · Naming Consistency · `ShowlightsXML` spells `XML` where 15 names in the project spell it `Xml` · ×1
  • `ShowlightsXML` spells `XML` where 15 names in the project spell it `Xml` src/Rocksmith2014.Common/Manifest/Attributes.fs:109 — 15 of 16 names in project DLCBuilder.Domain spell the token `Xml` (15 of 16; unit: names in project DLCBuilder.Domain containing `Xml`). Peers: Tools.ofdXml (samples/MiscTools/Tools.fs:113); Tools.ofdMultiXml (samples/MiscTools/Tools.fs:119); Attributes.SongXml (src/Rocksmith2014.Common/Manifest/Attributes.fs:141); ToneModule.importXml (REDACTED:180); ToneModule.fromXmlFile (REDACTED:208). Rename to `ShowlightsXml`. [rule N6]
D27 · Navigability · Scattered collaborators · ×1
  • Scattered collaborators — 94 % of calls cross a namespace and only 17 % of collaborators are co-located — group each feature's code into a vertical slice so a call's collaborators sit together.
D28 · Secrets (history) · Rotate the exposed credentials · ×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
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 REDACTED:6 — 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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation Directory.Packages.props:6 — `Directory.Packages.props` 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-c8fb8b8975a341c39e60405d831f30eb/history.json --exit-code 0 --source .2artifacts/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-c8fb8b8975a341c39e60405d831f30eb/tree.json --exit-code 0 --source .1artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .8artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—nuget: not applicable — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan0—
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-45c1bfbe616b416e92e7feb723d2b0920artifacts/raw/osv-scanner.json

Run 01a1de70-22c8-7cab-a89b-4224eb956e4b · 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