Executive summary
lichess-org/scalachess falls short of our standard for production because we found no logging, tracing or health checks in the code. It scores 59 out of 100 and is rated Adequate, and all ten of its critical findings are security problems in the build pipeline and in its automatic dependency updates.
Production Readiness, at 50, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 7 points. Adding a diagnostic log would lift Production Readiness itself, worth about 6 points. Raising Production Readiness to 70 would lift the score to about 65.
Nine pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One automatic update takes new releases before a bad one can be spotted. Pinning each tool to an exact version and setting a waiting period for automatic updates would close both risks.
The product code is 14,585 lines, about €27,000 to rebuild.
If Production Readiness rose from 50 to 70, the lowest score rated Strong, the score would rise from 59 to about 65.
New since the last survey: 11 findings
- Code Duplication · Edited copy of a member (18 corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copy of a member (8 corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copy of a member (6 corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copy of a member (17 corresponding lines) core/src/main/scala/Position.scala
- Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copies of one member (3 members, 8+ corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copy of a member (7 corresponding lines) core/src/main/scala/ByRole.scala
- Code Duplication · Edited copy of a member (4 corresponding lines) core/src/main/scala/Node.scala
- Code Duplication · Edited copies of one member (3 members, 5+ corresponding lines) tiebreak/src/main/scala/Tiebreak.scala
- Code Duplication · Edited copy of a member (5 corresponding lines) core/src/main/scala/ByRole.scala
- Code Duplication · Edited copy of a member (9 corresponding lines) test-kit/src/main/scala/chess/ChessTreeArbitraries.scala
Fixed since the last survey: 1 finding
- Platform End-of-Life · End-of-life runtime: Scala 3.8 build.sbt
Rebuild cost: about €27,000 · Estimate
| Cost to rebuild | €9,100 to €45,000, for 151 to 479 hours of work, about 0.2 person-years for one engineer |
|---|---|
| Difficulty of the problem | Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write. |
| Quality factor | ×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it. |
| Size | Small: 14,585 lines of product code |
| What it is not | Not 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. |
Top priorities
Diagnosis: what the measurements show together
Architecture — module dependency graph
Architecture: which parts of the code depend on which
| uses → | 1 (global) | 2 chess.Outcome | 3 chess.bitboard | 4 chess.eval | 5 chess.eval.Eval | 6 chess.rating | 7 chess.Clock | 8 chess.rating.Elo | 9 chess.variant | 10 chess.format | 11 chess.variant.Variant | 12 chess.format.pgn | 13 chess.format.pgn.Binary | 14 chess.format.pgn.Glyph | 15 chess.format.pgn.Tag | 16 chess.format.pgn.Tags | 17 chess.opening | 18 chess | 19 chess.Move | 20 chess.MoveOrDrop | 21 chess.Position | 22 chess.Replay | 23 chess.Speed | 24 chess.StartingPosition | 25 chess.TournamentClock | 26 chess.format.BinaryFen | 27 chess.format.Uci | 28 chess.format.UciCharPair | 29 chess.format.pgn.Parser | 30 chess.json | 31 chess.opening.Opening | 32 chess.rating.glicko | 33 chess.tiebreak | 34 chess.variant.Crazyhouse | 35 chess.rating.glicko.GlickoCalculator | 36 chess.rating.glicko.impl | 37 chess.tiebreak.Tiebreak | 38 chess.tiebreak.Tournament |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 (global) | ||||||||||||||||||||||||||||||||||||||
| 2 chess.Outcome | ||||||||||||||||||||||||||||||||||||||
| 3 chess.bitboard | ||||||||||||||||||||||||||||||||||||||
| 4 chess.eval | ||||||||||||||||||||||||||||||||||||||
| 5 chess.eval.Eval | ||||||||||||||||||||||||||||||||||||||
| 6 chess.rating | ||||||||||||||||||||||||||||||||||||||
| 7 chess.Clock | 3 | |||||||||||||||||||||||||||||||||||||
| 8 chess.rating.Elo | 1 | 3 | ||||||||||||||||||||||||||||||||||||
| 9 chess.variant | 6 | 82 | ||||||||||||||||||||||||||||||||||||
| 10 chess.format | 1 | 12 | ||||||||||||||||||||||||||||||||||||
| 11 chess.variant.Variant | 1 | |||||||||||||||||||||||||||||||||||||
| 12 chess.format.pgn | 1 | 1 | 34 | |||||||||||||||||||||||||||||||||||
| 13 chess.format.pgn.Binary | 2 | |||||||||||||||||||||||||||||||||||||
| 14 chess.format.pgn.Glyph | 3 | |||||||||||||||||||||||||||||||||||||
| 15 chess.format.pgn.Tag | 33 | |||||||||||||||||||||||||||||||||||||
| 16 chess.format.pgn.Tags | 1 | |||||||||||||||||||||||||||||||||||||
| 17 chess.opening | 3 | 2 | 4 | |||||||||||||||||||||||||||||||||||
| 18 chess | 2 | 3 | 4 | 1 | ||||||||||||||||||||||||||||||||||
| 19 chess.Move | 2 | |||||||||||||||||||||||||||||||||||||
| 20 chess.MoveOrDrop | 2 | |||||||||||||||||||||||||||||||||||||
| 21 chess.Position | 4 | |||||||||||||||||||||||||||||||||||||
| 22 chess.Replay | 2 | |||||||||||||||||||||||||||||||||||||
| 23 chess.Speed | 6 | |||||||||||||||||||||||||||||||||||||
| 24 chess.StartingPosition | 1 | |||||||||||||||||||||||||||||||||||||
| 25 chess.TournamentClock | 1 | |||||||||||||||||||||||||||||||||||||
| 26 chess.format.BinaryFen | 4 | |||||||||||||||||||||||||||||||||||||
| 27 chess.format.Uci | 3 | 10 | ||||||||||||||||||||||||||||||||||||
| 28 chess.format.UciCharPair | 5 | |||||||||||||||||||||||||||||||||||||
| 29 chess.format.pgn.Parser | 6 | 5 | ||||||||||||||||||||||||||||||||||||
| 30 chess.json | 2 | |||||||||||||||||||||||||||||||||||||
| 31 chess.opening.Opening | 2 | 1 | ||||||||||||||||||||||||||||||||||||
| 32 chess.rating.glicko | 4 | |||||||||||||||||||||||||||||||||||||
| 33 chess.tiebreak | 1 | |||||||||||||||||||||||||||||||||||||
| 34 chess.variant.Crazyhouse | 5 | |||||||||||||||||||||||||||||||||||||
| 35 chess.rating.glicko.GlickoCalculator | 1 | 2 | 1 | |||||||||||||||||||||||||||||||||||
| 36 chess.rating.glicko.impl | 4 | |||||||||||||||||||||||||||||||||||||
| 37 chess.tiebreak.Tiebreak | 1 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||
| 38 chess.tiebreak.Tournament | 1 | 1 |
7→18 chess.Clock uses chess part of a loop✕
- Connections
- 3 pairs of types, where a type in chess.Clock uses a type in chess.
- The types involved
chess.Clock.Config→chess.Centischess.Clock.Config→chess.Clockchess.Clock.WithCompensatedLag→chess.Centis
- Direction
- chess.Clock uses chess, so a change to chess can break chess.Clock, while a change to chess.Clock can't break chess.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→2 chess.rating.Elo uses chess.Outcome✕
- Connections
- 1 pair of types, where a type in chess.rating.Elo uses a type in chess.Outcome.
- The types involved
chess.rating.Elo.Game→chess.Outcome.Points
- Direction
- chess.rating.Elo uses chess.Outcome, so a change to chess.Outcome can break chess.rating.Elo, while a change to chess.rating.Elo can't break chess.Outcome.
- Position
- Below the diagonal: chess.rating.Elo uses a module listed above it, which is the healthy direction.
8→6 chess.rating.Elo uses chess.rating✕
- Connections
- 3 pairs of types, where a type in chess.rating.Elo uses a type in chess.rating.
- The types involved
chess.rating.Elo.Game→chess.rating.Elochess.rating.Elo.Player→chess.rating.Elochess.rating.Elo.Player→chess.rating.KFactor
- Direction
- chess.rating.Elo uses chess.rating, so a change to chess.rating can break chess.rating.Elo, while a change to chess.rating.Elo can't break chess.rating.
- Position
- Below the diagonal: chess.rating.Elo uses a module listed above it, which is the healthy direction.
9→10 chess.variant uses chess.format part of a loop✕
- Connections
- 6 pairs of types, where a type in chess.variant uses a type in chess.format.
- The types involved
chess.variant.Antichess→chess.format.FullFenchess.variant.Chess960→chess.format.FullFenchess.variant.Crazyhouse→chess.format.FullFenchess.variant.Horde→chess.format.FullFenchess.variant.RacingKings→chess.format.FullFenchess.variant.ThreeCheck→chess.format.FullFen
- Direction
- chess.variant uses chess.format, so a change to chess.format can break chess.variant, while a change to chess.variant can't break chess.format.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
9→18 chess.variant uses chess part of a loop✕
- Connections
- 82 pairs of types, where a type in chess.variant uses a type in chess. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
chess.variant.Antichess→chess.Boardchess.variant.Antichess→chess.Castleschess.variant.Antichess→chess.Checkchess.variant.Antichess→chess.Colorchess.variant.Antichess→chess.Movechess.variant.Antichess→chess.Piecechess.variant.Antichess→chess.Positionchess.variant.Antichess→chess.PromotableRolechess.variant.Antichess→chess.Squarechess.variant.Atomic→chess.Bitboardchess.variant.Atomic→chess.Boardchess.variant.Atomic→chess.Checkchess.variant.Atomic→chess.Colorchess.variant.Atomic→chess.Movechess.variant.Atomic→chess.Piecechess.variant.Atomic→chess.Positionchess.variant.Atomic→chess.Squarechess.variant.Chess960→chess.Movechess.variant.Chess960→chess.Positionchess.variant.Chess960→chess.Squarechess.variant.Crazyhouse→chess.Bitboardchess.variant.Crazyhouse→chess.Boardchess.variant.Crazyhouse→chess.Dropchess.variant.Crazyhouse→chess.ErrorStrchess.variant.Crazyhouse→chess.History
- Direction
- chess.variant uses chess, so a change to chess can break chess.variant, while a change to chess.variant can't break chess.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
10→9 chess.format uses chess.variant✕
- Connections
- 1 pair of types, where a type in chess.format uses a type in chess.variant.
- The types involved
chess.format.UciDump→chess.variant.Variant
- Direction
- chess.format uses chess.variant, so a change to chess.variant can break chess.format, while a change to chess.format can't break chess.variant.
- Position
- Below the diagonal: chess.format uses a module listed above it, which is the healthy direction.
10→18 chess.format uses chess part of a loop✕
- Connections
- 12 pairs of types, where a type in chess.format uses a type in chess.
- The types involved
chess.format.FenReader→chess.CheckCountchess.format.FenReader→chess.Plychess.format.FenReader→chess.Positionchess.format.FenWriter→chess.CheckCountchess.format.FenWriter→chess.Colorchess.format.FenWriter→chess.FullMoveNumberchess.format.FenWriter→chess.Gamechess.format.FenWriter→chess.Positionchess.format.Uci→chess.Moveablechess.format.UciDump→chess.ErrorStrchess.format.UciDump→chess.MoveOrDropchess.format.UciDump→chess.Position
- Direction
- chess.format uses chess, so a change to chess can break chess.format, while a change to chess.format can't break chess.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
11→9 chess.variant.Variant uses chess.variant✕
- Connections
- 1 pair of types, where a type in chess.variant.Variant uses a type in chess.variant.
- The types involved
chess.variant.Variant.list→chess.variant.Variant
- Direction
- chess.variant.Variant uses chess.variant, so a change to chess.variant can break chess.variant.Variant, while a change to chess.variant.Variant can't break chess.variant.
- Position
- Below the diagonal: chess.variant.Variant uses a module listed above it, which is the healthy direction.
12→9 chess.format.pgn uses chess.variant✕
- Connections
- 1 pair of types, where a type in chess.format.pgn uses a type in chess.variant.
- The types involved
chess.format.pgn.Tags→chess.variant.Variant
- Direction
- chess.format.pgn uses chess.variant, so a change to chess.variant can break chess.format.pgn, while a change to chess.format.pgn can't break chess.variant.
- Position
- Below the diagonal: chess.format.pgn uses a module listed above it, which is the healthy direction.
12→10 chess.format.pgn uses chess.format✕
- Connections
- 1 pair of types, where a type in chess.format.pgn uses a type in chess.format.
- The types involved
chess.format.pgn.Tags→chess.format.FullFen
- Direction
- chess.format.pgn uses chess.format, so a change to chess.format can break chess.format.pgn, while a change to chess.format.pgn can't break chess.format.
- Position
- Below the diagonal: chess.format.pgn uses a module listed above it, which is the healthy direction.
12→18 chess.format.pgn uses chess part of a loop✕
- Connections
- 34 pairs of types, where a type in chess.format.pgn uses a type in chess. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
chess.format.pgn.Castle→chess.ErrorStrchess.format.pgn.Castle→chess.Positionchess.format.pgn.Castle→chess.Sidechess.format.pgn.Drop→chess.ErrorStrchess.format.pgn.Drop→chess.Positionchess.format.pgn.Drop→chess.Rolechess.format.pgn.Drop→chess.Squarechess.format.pgn.Dumper→chess.Positionchess.format.pgn.Metas→chess.Checkchess.format.pgn.ParsedMainline→chess.Gamechess.format.pgn.ParsedMainline→chess.Positionchess.format.pgn.ParsedPgn→chess.Gamechess.format.pgn.ParsedPgn→chess.Nodechess.format.pgn.ParsedPgn→chess.Positionchess.format.pgn.Parser→chess.ErrorStrchess.format.pgn.Parser→chess.Nodechess.format.pgn.Pgn→chess.Plychess.format.pgn.PgnNodeData→chess.Positionchess.format.pgn.San→chess.Moveablechess.format.pgn.Std→chess.ErrorStrchess.format.pgn.Std→chess.Filechess.format.pgn.Std→chess.Positionchess.format.pgn.Std→chess.PromotableRolechess.format.pgn.Std→chess.Rankchess.format.pgn.Std→chess.Role
- Direction
- chess.format.pgn uses chess, so a change to chess can break chess.format.pgn, while a change to chess.format.pgn can't break chess.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
13→12 chess.format.pgn.Binary uses chess.format.pgn✕
- Connections
- 2 pairs of types, where a type in chess.format.pgn.Binary uses a type in chess.format.pgn.
- The types involved
chess.format.pgn.Binary.Reader→chess.format.pgn.SanStrchess.format.pgn.Binary.Writer→chess.format.pgn.SanStr
- Direction
- chess.format.pgn.Binary uses chess.format.pgn, so a change to chess.format.pgn can break chess.format.pgn.Binary, while a change to chess.format.pgn.Binary can't break chess.format.pgn.
- Position
- Below the diagonal: chess.format.pgn.Binary uses a module listed above it, which is the healthy direction.
14→12 chess.format.pgn.Glyph uses chess.format.pgn✕
- Connections
- 3 pairs of types, where a type in chess.format.pgn.Glyph uses a type in chess.format.pgn.
- The types involved
chess.format.pgn.Glyph.MoveAssessment→chess.format.pgn.Glyphchess.format.pgn.Glyph.Observation→chess.format.pgn.Glyphchess.format.pgn.Glyph.PositionAssessment→chess.format.pgn.Glyph
- Direction
- chess.format.pgn.Glyph uses chess.format.pgn, so a change to chess.format.pgn can break chess.format.pgn.Glyph, while a change to chess.format.pgn.Glyph can't break chess.format.pgn.
- Position
- Below the diagonal: chess.format.pgn.Glyph uses a module listed above it, which is the healthy direction.
15→12 chess.format.pgn.Tag uses chess.format.pgn✕
- Connections
- 33 pairs of types, where a type in chess.format.pgn.Tag uses a type in chess.format.pgn. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
chess.format.pgn.Tag.Annotator→chess.format.pgn.TagTypechess.format.pgn.Tag.Black→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackClock→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackElo→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackFideId→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackRatingDiff→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackTeam→chess.format.pgn.TagTypechess.format.pgn.Tag.BlackTitle→chess.format.pgn.TagTypechess.format.pgn.Tag.Board→chess.format.pgn.TagTypechess.format.pgn.Tag.Date→chess.format.pgn.TagTypechess.format.pgn.Tag.ECO→chess.format.pgn.TagTypechess.format.pgn.Tag.Event→chess.format.pgn.TagTypechess.format.pgn.Tag.FEN→chess.format.pgn.TagTypechess.format.pgn.Tag.GameId→chess.format.pgn.TagTypechess.format.pgn.Tag.Opening→chess.format.pgn.TagTypechess.format.pgn.Tag.Orientation→chess.format.pgn.TagTypechess.format.pgn.Tag.ReferenceTime→chess.format.pgn.TagTypechess.format.pgn.Tag.Result→chess.format.pgn.TagTypechess.format.pgn.Tag.Round→chess.format.pgn.TagTypechess.format.pgn.Tag.Site→chess.format.pgn.TagTypechess.format.pgn.Tag.Termination→chess.format.pgn.TagTypechess.format.pgn.Tag.TimeControl→chess.format.pgn.TagTypechess.format.pgn.Tag.UTCDate→chess.format.pgn.TagTypechess.format.pgn.Tag.UTCTime→chess.format.pgn.TagTypechess.format.pgn.Tag.Unknown→chess.format.pgn.TagType
- Direction
- chess.format.pgn.Tag uses chess.format.pgn, so a change to chess.format.pgn can break chess.format.pgn.Tag, while a change to chess.format.pgn.Tag can't break chess.format.pgn.
- Position
- Below the diagonal: chess.format.pgn.Tag uses a module listed above it, which is the healthy direction.
16→12 chess.format.pgn.Tags uses chess.format.pgn✕
- Connections
- 1 pair of types, where a type in chess.format.pgn.Tags uses a type in chess.format.pgn.
- The types involved
chess.format.pgn.Tags.sanitize→chess.format.pgn.Tag
- Direction
- chess.format.pgn.Tags uses chess.format.pgn, so a change to chess.format.pgn can break chess.format.pgn.Tags, while a change to chess.format.pgn.Tags can't break chess.format.pgn.
- Position
- Below the diagonal: chess.format.pgn.Tags uses a module listed above it, which is the healthy direction.
17→10 chess.opening uses chess.format✕
- Connections
- 3 pairs of types, where a type in chess.opening uses a type in chess.format.
- The types involved
chess.opening.Opening→chess.format.StandardFenchess.opening.OpeningDb→chess.format.FullFenchess.opening.OpeningDb→chess.format.StandardFen
- Direction
- chess.opening uses chess.format, so a change to chess.format can break chess.opening, while a change to chess.opening can't break chess.format.
- Position
- Below the diagonal: chess.opening uses a module listed above it, which is the healthy direction.
17→12 chess.opening uses chess.format.pgn✕
- Connections
- 2 pairs of types, where a type in chess.opening uses a type in chess.format.pgn.
- The types involved
chess.opening.Opening→chess.format.pgn.PgnMovesStrchess.opening.OpeningDb→chess.format.pgn.SanStr
- Direction
- chess.opening uses chess.format.pgn, so a change to chess.format.pgn can break chess.opening, while a change to chess.opening can't break chess.format.pgn.
- Position
- Below the diagonal: chess.opening uses a module listed above it, which is the healthy direction.
17→18 chess.opening uses chess part of a loop✕
- Connections
- 4 pairs of types, where a type in chess.opening uses a type in chess.
- The types involved
chess.opening.Opening→chess.Movechess.opening.Opening→chess.Plychess.opening.OpeningDb→chess.MoveOrDropchess.opening.OpeningDb→chess.Position
- Direction
- chess.opening uses chess, so a change to chess can break chess.opening, while a change to chess.opening can't break chess.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
18→7 chess uses chess.Clock✕
- Connections
- 2 pairs of types, where a type in chess uses a type in chess.Clock.
- The types involved
chess.Clock→chess.Clock.Configchess.ClockPlayer→chess.Clock.Config
- Direction
- chess uses chess.Clock, so a change to chess.Clock can break chess, while a change to chess can't break chess.Clock.
- Position
- Below the diagonal: chess uses a module listed above it, which is the healthy direction.
18→10 chess uses chess.format✕
- Connections
- 3 pairs of types, where a type in chess uses a type in chess.format.
- The types involved
chess.EndgamePosition→chess.format.FullFenchess.Game→chess.format.Ucichess.MoveOrDrop→chess.format.Uci
- Direction
- chess uses chess.format, so a change to chess.format can break chess, while a change to chess can't break chess.format.
- Position
- Below the diagonal: chess uses a module listed above it, which is the healthy direction.
18→12 chess uses chess.format.pgn✕
- Connections
- 4 pairs of types, where a type in chess uses a type in chess.format.pgn.
- The types involved
chess.Drop→chess.format.pgn.SanStrchess.Game→chess.format.pgn.SanStrchess.Move→chess.format.pgn.SanStrchess.MoveOrDrop→chess.format.pgn.SanStr
- Direction
- chess uses chess.format.pgn, so a change to chess.format.pgn can break chess, while a change to chess can't break chess.format.pgn.
- Position
- Below the diagonal: chess uses a module listed above it, which is the healthy direction.
18→17 chess uses chess.opening✕
- Connections
- 1 pair of types, where a type in chess uses a type in chess.opening.
- The types involved
chess.StartingPosition→chess.opening.Opening
- Direction
- chess uses chess.opening, so a change to chess.opening can break chess, while a change to chess can't break chess.opening.
- Position
- Below the diagonal: chess uses a module listed above it, which is the healthy direction.
19→18 chess.Move uses chess✕
- Connections
- 2 pairs of types, where a type in chess.Move uses a type in chess.
- The types involved
chess.Move.Castle→chess.Sidechess.Move.Castle→chess.Square
- Direction
- chess.Move uses chess, so a change to chess can break chess.Move, while a change to chess.Move can't break chess.
- Position
- Below the diagonal: chess.Move uses a module listed above it, which is the healthy direction.
20→18 chess.MoveOrDrop uses chess✕
- Connections
- 2 pairs of types, where a type in chess.MoveOrDrop uses a type in chess.
- The types involved
chess.MoveOrDrop.WithPly→chess.MoveOrDropchess.MoveOrDrop.WithPly→chess.Ply
- Direction
- chess.MoveOrDrop uses chess, so a change to chess can break chess.MoveOrDrop, while a change to chess.MoveOrDrop can't break chess.
- Position
- Below the diagonal: chess.MoveOrDrop uses a module listed above it, which is the healthy direction.
21→18 chess.Position uses chess✕
- Connections
- 4 pairs of types, where a type in chess.Position uses a type in chess.
- The types involved
chess.Position.AndFullMoveNumber→chess.FullMoveNumberchess.Position.AndFullMoveNumber→chess.Gamechess.Position.AndFullMoveNumber→chess.Plychess.Position.AndFullMoveNumber→chess.Position
- Direction
- chess.Position uses chess, so a change to chess can break chess.Position, while a change to chess.Position can't break chess.
- Position
- Below the diagonal: chess.Position uses a module listed above it, which is the healthy direction.
22→18 chess.Replay uses chess✕
- Connections
- 2 pairs of types, where a type in chess.Replay uses a type in chess.
- The types involved
chess.Replay.Result→chess.ErrorStrchess.Replay.Result→chess.Replay
- Direction
- chess.Replay uses chess, so a change to chess can break chess.Replay, while a change to chess.Replay can't break chess.
- Position
- Below the diagonal: chess.Replay uses a module listed above it, which is the healthy direction.
23→18 chess.Speed uses chess✕
- Connections
- 6 pairs of types, where a type in chess.Speed uses a type in chess.
- The types involved
chess.Speed.Blitz→chess.Speedchess.Speed.Bullet→chess.Speedchess.Speed.Classical→chess.Speedchess.Speed.Correspondence→chess.Speedchess.Speed.Rapid→chess.Speedchess.Speed.UltraBullet→chess.Speed
- Direction
- chess.Speed uses chess, so a change to chess can break chess.Speed, while a change to chess.Speed can't break chess.
- Position
- Below the diagonal: chess.Speed uses a module listed above it, which is the healthy direction.
24→18 chess.StartingPosition uses chess✕
- Connections
- 1 pair of types, where a type in chess.StartingPosition uses a type in chess.
- The types involved
chess.StartingPosition.Category→chess.StartingPosition
- Direction
- chess.StartingPosition uses chess, so a change to chess can break chess.StartingPosition, while a change to chess.StartingPosition can't break chess.
- Position
- Below the diagonal: chess.StartingPosition uses a module listed above it, which is the healthy direction.
25→18 chess.TournamentClock uses chess✕
- Connections
- 1 pair of types, where a type in chess.TournamentClock uses a type in chess.
- The types involved
chess.TournamentClock.parse→chess.TournamentClock
- Direction
- chess.TournamentClock uses chess, so a change to chess can break chess.TournamentClock, while a change to chess.TournamentClock can't break chess.
- Position
- Below the diagonal: chess.TournamentClock uses a module listed above it, which is the healthy direction.
26→18 chess.format.BinaryFen uses chess✕
- Connections
- 4 pairs of types, where a type in chess.format.BinaryFen uses a type in chess.
- The types involved
chess.format.BinaryFen.implementation→chess.Bitboardchess.format.BinaryFen.implementation→chess.Castleschess.format.BinaryFen.implementation→chess.Positionchess.format.BinaryFen.implementation→chess.UnmovedRooks
- Direction
- chess.format.BinaryFen uses chess, so a change to chess can break chess.format.BinaryFen, while a change to chess.format.BinaryFen can't break chess.
- Position
- Below the diagonal: chess.format.BinaryFen uses a module listed above it, which is the healthy direction.
27→10 chess.format.Uci uses chess.format✕
- Connections
- 3 pairs of types, where a type in chess.format.Uci uses a type in chess.format.
- The types involved
chess.format.Uci.Drop→chess.format.Ucichess.format.Uci.Move→chess.format.Ucichess.format.Uci.WithSan→chess.format.Uci
- Direction
- chess.format.Uci uses chess.format, so a change to chess.format can break chess.format.Uci, while a change to chess.format.Uci can't break chess.format.
- Position
- Below the diagonal: chess.format.Uci uses a module listed above it, which is the healthy direction.
27→18 chess.format.Uci uses chess✕
- Connections
- 10 pairs of types, where a type in chess.format.Uci uses a type in chess.
- The types involved
chess.format.Uci.Drop→chess.ErrorStrchess.format.Uci.Drop→chess.MoveOrDropchess.format.Uci.Drop→chess.Positionchess.format.Uci.Drop→chess.Rolechess.format.Uci.Drop→chess.Squarechess.format.Uci.Move→chess.ErrorStrchess.format.Uci.Move→chess.MoveOrDropchess.format.Uci.Move→chess.Positionchess.format.Uci.Move→chess.PromotableRolechess.format.Uci.Move→chess.Square
- Direction
- chess.format.Uci uses chess, so a change to chess can break chess.format.Uci, while a change to chess.format.Uci can't break chess.
- Position
- Below the diagonal: chess.format.Uci uses a module listed above it, which is the healthy direction.
28→18 chess.format.UciCharPair uses chess✕
- Connections
- 5 pairs of types, where a type in chess.format.UciCharPair uses a type in chess.
- The types involved
chess.format.UciCharPair.implementation→chess.Filechess.format.UciCharPair.implementation→chess.PromotableRolechess.format.UciCharPair.implementation→chess.Rankchess.format.UciCharPair.implementation→chess.Rolechess.format.UciCharPair.implementation→chess.Square
- Direction
- chess.format.UciCharPair uses chess, so a change to chess can break chess.format.UciCharPair, while a change to chess.format.UciCharPair can't break chess.
- Position
- Below the diagonal: chess.format.UciCharPair uses a module listed above it, which is the healthy direction.
29→12 chess.format.pgn.Parser uses chess.format.pgn✕
- Connections
- 6 pairs of types, where a type in chess.format.pgn.Parser uses a type in chess.format.pgn.
- The types involved
chess.format.pgn.Parser.SanParser→chess.format.pgn.Dropchess.format.pgn.Parser.SanParser→chess.format.pgn.Glyphchess.format.pgn.Parser.SanParser→chess.format.pgn.Metaschess.format.pgn.Parser.SanParser→chess.format.pgn.Sanchess.format.pgn.Parser.SanParser→chess.format.pgn.Stdchess.format.pgn.Parser.TagParser→chess.format.pgn.Tag
- Direction
- chess.format.pgn.Parser uses chess.format.pgn, so a change to chess.format.pgn can break chess.format.pgn.Parser, while a change to chess.format.pgn.Parser can't break chess.format.pgn.
- Position
- Below the diagonal: chess.format.pgn.Parser uses a module listed above it, which is the healthy direction.
29→18 chess.format.pgn.Parser uses chess✕
- Connections
- 5 pairs of types, where a type in chess.format.pgn.Parser uses a type in chess.
- The types involved
chess.format.pgn.Parser.SanParser→chess.Filechess.format.pgn.Parser.SanParser→chess.PromotableRolechess.format.pgn.Parser.SanParser→chess.Rankchess.format.pgn.Parser.SanParser→chess.Sidechess.format.pgn.Parser.SanParser→chess.Square
- Direction
- chess.format.pgn.Parser uses chess, so a change to chess can break chess.format.pgn.Parser, while a change to chess.format.pgn.Parser can't break chess.
- Position
- Below the diagonal: chess.format.pgn.Parser uses a module listed above it, which is the healthy direction.
30→18 chess.json uses chess✕
- Connections
- 2 pairs of types, where a type in chess.json uses a type in chess.
- The types involved
chess.json.Json→chess.Bitboardchess.json.Json→chess.Square
- Direction
- chess.json uses chess, so a change to chess can break chess.json, while a change to chess.json can't break chess.
- Position
- Below the diagonal: chess.json uses a module listed above it, which is the healthy direction.
31→17 chess.opening.Opening uses chess.opening✕
- Connections
- 2 pairs of types, where a type in chess.opening.Opening uses a type in chess.opening.
- The types involved
chess.opening.Opening.AtPly→chess.opening.Openingchess.opening.Opening.nameToKey→chess.opening.OpeningName
- Direction
- chess.opening.Opening uses chess.opening, so a change to chess.opening can break chess.opening.Opening, while a change to chess.opening.Opening can't break chess.opening.
- Position
- Below the diagonal: chess.opening.Opening uses a module listed above it, which is the healthy direction.
31→18 chess.opening.Opening uses chess✕
- Connections
- 1 pair of types, where a type in chess.opening.Opening uses a type in chess.
- The types involved
chess.opening.Opening.AtPly→chess.Ply
- Direction
- chess.opening.Opening uses chess, so a change to chess can break chess.opening.Opening, while a change to chess.opening.Opening can't break chess.
- Position
- Below the diagonal: chess.opening.Opening uses a module listed above it, which is the healthy direction.
32→18 chess.rating.glicko uses chess✕
- Connections
- 4 pairs of types, where a type in chess.rating.glicko uses a type in chess.
- The types involved
chess.rating.glicko.Game→chess.ByColorchess.rating.glicko.Game→chess.Outcomechess.rating.glicko.Glicko→chess.IntRatingchess.rating.glicko.GlickoCalculator→chess.ByColor
- Direction
- chess.rating.glicko uses chess, so a change to chess can break chess.rating.glicko, while a change to chess.rating.glicko can't break chess.
- Position
- Below the diagonal: chess.rating.glicko uses a module listed above it, which is the healthy direction.
33→18 chess.tiebreak uses chess✕
- Connections
- 1 pair of types, where a type in chess.tiebreak uses a type in chess.
- The types involved
chess.tiebreak.Tournament→chess.Game
- Direction
- chess.tiebreak uses chess, so a change to chess can break chess.tiebreak, while a change to chess.tiebreak can't break chess.
- Position
- Below the diagonal: chess.tiebreak uses a module listed above it, which is the healthy direction.
34→18 chess.variant.Crazyhouse uses chess✕
- Connections
- 5 pairs of types, where a type in chess.variant.Crazyhouse uses a type in chess.
- The types involved
chess.variant.Crazyhouse.Data→chess.Bitboardchess.variant.Crazyhouse.Data→chess.Piecechess.variant.Crazyhouse.Data→chess.Squarechess.variant.Crazyhouse.Pocket→chess.Rolechess.variant.Crazyhouse.Pockets→chess.Piece
- Direction
- chess.variant.Crazyhouse uses chess, so a change to chess can break chess.variant.Crazyhouse, while a change to chess.variant.Crazyhouse can't break chess.
- Position
- Below the diagonal: chess.variant.Crazyhouse uses a module listed above it, which is the healthy direction.
35→6 chess.rating.glicko.GlickoCalculator uses chess.rating✕
- Connections
- 1 pair of types, where a type in chess.rating.glicko.GlickoCalculator uses a type in chess.rating.
- The types involved
chess.rating.glicko.GlickoCalculator.conversions→chess.rating.Rating
- Direction
- chess.rating.glicko.GlickoCalculator uses chess.rating, so a change to chess.rating can break chess.rating.glicko.GlickoCalculator, while a change to chess.rating.glicko.GlickoCalculator can't break chess.rating.
- Position
- Below the diagonal: chess.rating.glicko.GlickoCalculator uses a module listed above it, which is the healthy direction.
35→18 chess.rating.glicko.GlickoCalculator uses chess✕
- Connections
- 2 pairs of types, where a type in chess.rating.glicko.GlickoCalculator uses a type in chess.
- The types involved
chess.rating.glicko.GlickoCalculator.conversions→chess.ByColorchess.rating.glicko.GlickoCalculator.conversions→chess.Outcome
- Direction
- chess.rating.glicko.GlickoCalculator uses chess, so a change to chess can break chess.rating.glicko.GlickoCalculator, while a change to chess.rating.glicko.GlickoCalculator can't break chess.
- Position
- Below the diagonal: chess.rating.glicko.GlickoCalculator uses a module listed above it, which is the healthy direction.
35→32 chess.rating.glicko.GlickoCalculator uses chess.rating.glicko✕
- Connections
- 1 pair of types, where a type in chess.rating.glicko.GlickoCalculator uses a type in chess.rating.glicko.
- The types involved
chess.rating.glicko.GlickoCalculator.conversions→chess.rating.glicko.Player
- Direction
- chess.rating.glicko.GlickoCalculator uses chess.rating.glicko, so a change to chess.rating.glicko can break chess.rating.glicko.GlickoCalculator, while a change to chess.rating.glicko.GlickoCalculator can't break chess.rating.glicko.
- Position
- Below the diagonal: chess.rating.glicko.GlickoCalculator uses a module listed above it, which is the healthy direction.
36→32 chess.rating.glicko.impl uses chess.rating.glicko✕
- Connections
- 4 pairs of types, where a type in chess.rating.glicko.impl uses a type in chess.rating.glicko.
- The types involved
chess.rating.glicko.impl.FloatingResult→chess.rating.glicko.ColorAdvantagechess.rating.glicko.impl.GameResult→chess.rating.glicko.ColorAdvantagechess.rating.glicko.impl.Rating→chess.rating.glicko.ColorAdvantagechess.rating.glicko.impl.Result→chess.rating.glicko.ColorAdvantage
- Direction
- chess.rating.glicko.impl uses chess.rating.glicko, so a change to chess.rating.glicko can break chess.rating.glicko.impl, while a change to chess.rating.glicko.impl can't break chess.rating.glicko.
- Position
- Below the diagonal: chess.rating.glicko.impl uses a module listed above it, which is the healthy direction.
37→2 chess.tiebreak.Tiebreak uses chess.Outcome✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tiebreak uses a type in chess.Outcome.
- The types involved
chess.tiebreak.Tiebreak.Game→chess.Outcome.Points
- Direction
- chess.tiebreak.Tiebreak uses chess.Outcome, so a change to chess.Outcome can break chess.tiebreak.Tiebreak, while a change to chess.tiebreak.Tiebreak can't break chess.Outcome.
- Position
- Below the diagonal: chess.tiebreak.Tiebreak uses a module listed above it, which is the healthy direction.
37→6 chess.tiebreak.Tiebreak uses chess.rating✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tiebreak uses a type in chess.rating.
- The types involved
chess.tiebreak.Tiebreak.Player→chess.rating.Elo
- Direction
- chess.tiebreak.Tiebreak uses chess.rating, so a change to chess.rating can break chess.tiebreak.Tiebreak, while a change to chess.tiebreak.Tiebreak can't break chess.rating.
- Position
- Below the diagonal: chess.tiebreak.Tiebreak uses a module listed above it, which is the healthy direction.
37→18 chess.tiebreak.Tiebreak uses chess✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tiebreak uses a type in chess.
- The types involved
chess.tiebreak.Tiebreak.Game→chess.Color
- Direction
- chess.tiebreak.Tiebreak uses chess, so a change to chess can break chess.tiebreak.Tiebreak, while a change to chess.tiebreak.Tiebreak can't break chess.
- Position
- Below the diagonal: chess.tiebreak.Tiebreak uses a module listed above it, which is the healthy direction.
37→33 chess.tiebreak.Tiebreak uses chess.tiebreak✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tiebreak uses a type in chess.tiebreak.
- The types involved
chess.tiebreak.Tiebreak.PlayerWithScore→chess.tiebreak.TiebreakPoint
- Direction
- chess.tiebreak.Tiebreak uses chess.tiebreak, so a change to chess.tiebreak can break chess.tiebreak.Tiebreak, while a change to chess.tiebreak.Tiebreak can't break chess.tiebreak.
- Position
- Below the diagonal: chess.tiebreak.Tiebreak uses a module listed above it, which is the healthy direction.
38→18 chess.tiebreak.Tournament uses chess✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tournament uses a type in chess.
- The types involved
chess.tiebreak.Tournament.Impl→chess.Game
- Direction
- chess.tiebreak.Tournament uses chess, so a change to chess can break chess.tiebreak.Tournament, while a change to chess.tiebreak.Tournament can't break chess.
- Position
- Below the diagonal: chess.tiebreak.Tournament uses a module listed above it, which is the healthy direction.
38→33 chess.tiebreak.Tournament uses chess.tiebreak✕
- Connections
- 1 pair of types, where a type in chess.tiebreak.Tournament uses a type in chess.tiebreak.
- The types involved
chess.tiebreak.Tournament.Impl→chess.tiebreak.Tournament
- Direction
- chess.tiebreak.Tournament uses chess.tiebreak, so a change to chess.tiebreak can break chess.tiebreak.Tournament, while a change to chess.tiebreak.Tournament can't break chess.tiebreak.
- Position
- Below the diagonal: chess.tiebreak.Tournament uses a module listed above it, which is the healthy direction.
At a glance — Code Health
At a glance — Architecture
At a glance — Maturity
At a glance — Readiness
At a glance — Security
At a glance — Performance
Security & Compliance — OWASP Top-10 mapping
| OWASP category | Findings | Severity |
|---|---|---|
| A05:2025 — Injection | 10 | High / Critical |
Roadmap
Top priorities: 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; Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
| Do this | Helps | Effort | Dimension |
|---|---|---|---|
| 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. | +6.7 pts | Medium | Architecture documentation |
| Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce. | +5.7 pts | Medium | Observability |
| Resolve the 2 Off-boarding risk finding(s) in Bus Factor. | +1.9 pts | Low | Bus Factor |
| On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it. | +2.8 pts | Medium | Nullable reference types |
| Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release. | +2.3 pts | Medium | Release Hygiene |
| 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.1 pts | Medium | Documentation (README) |
| Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. | +0.9 pts | Low | Bus Factor |
| Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally. | +1.2 pts | Medium | Security & performance tooling |
File quality
| File | Score | Band | Worst signal |
|---|---|---|---|
| REDACTED | 2.3 | Slop | Static Analysis (SAST): High: REDACTED |
| core/src/main/scala/format/FenReader.scala | 6.0 | Mixed | Explicit Debt: TodoComment |
| core/src/main/scala/Node.scala | 6.0 | Mixed | Explicit Debt: TodoComment |
| core/src/main/scala/format/BinaryFen.scala | 7.2 | Mixed | Cyclomatic Complexity: BinaryFen.write (cyclomatic 39) |
| core/src/main/scala/Position.scala | 7.2 | Mixed | Cognitive Complexity: Position.genPawn (cognitive 30) |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| core/src/main/scala/ByRole.scala | 7.4 | Mixed | Code Duplication: Edited copy of a member (7 corresponding lines) |
| core/src/main/scala/variant/Horde.scala | 7.8 | Mixed | Cyclomatic Complexity: Horde.hasInsufficientMaterial (cyclomatic 52) |
| core/src/main/scala/Divider.scala | 7.8 | Mixed | Cyclomatic Complexity: Divider.score (cyclomatic 26) |
| core/src/main/scala/format/FenWriter.scala | 7.8 | Mixed | Cognitive Complexity: FenWriter.writeCastles (cognitive 22) |
| core/src/main/scala/variant/Crazyhouse.scala | 7.8 | Mixed | Cognitive Complexity: Crazyhouse.legalDrops (cognitive 20) |
| test-kit/src/test/scala/format/pgn/Fixtures.scala | 8.2 | Near-clean | Explicit Debt: TodoComment |
| core/src/main/scala/format/pgn/Parser.scala | 8.2 | Near-clean | Explicit Debt: TodoComment |
| core/src/main/scala/format/pgn/Dumper.scala | 8.5 | Near-clean | Cognitive Complexity: Dumper.apply (cognitive 17) |
| core/src/main/scala/Hash.scala | 8.5 | Near-clean | Cognitive Complexity: Hash.hashPosition (cognitive 16) |
| core/src/main/scala/MoveOrDrop.scala | 8.5 | Near-clean | Cognitive Complexity: Move.castleRights (cognitive 16) |
| core/src/main/scala/variant/Variant.scala | 8.5 | Near-clean | God Classes: TooManyMethods: Variant |
| tiebreak/src/main/scala/Tiebreak.scala | 8.5 | Near-clean | Code Duplication: Edited copies of one member (3 members, 5+ corresponding lines) |
| test-kit/src/main/scala/chess/ChessTreeArbitraries.scala | 8.5 | Near-clean | Code Duplication: Edited copy of a member (9 corresponding lines) |
| core/src/main/scala/File.scala | 8.5 | Near-clean | Change Coupling: Change coupling: File.scala ↔ Rank.scala |
How the grades work
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.
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.
Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.
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 41 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
What we checked — 41 dimensions across the health lenses
- 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, 54 of 64 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line.
- Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
- Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
Tools & methods
| Method | Backs | Version | Evaluator |
|---|---|---|---|
| Roslyn static analysis | Complexity, cohesion, coupling, dead code, API surface, layering | 5.3.0 | ✓ deterministic |
| Native secret scanner | Hardcoded secrets / credentials | 1.0.0 | ✓ deterministic |
| Canine Code Analyzer duplication detector (in-process) | Code duplication | 1.0.0 | ✓ deterministic |
| Coverage (coverlet / dotnet-coverage) | Line & branch coverage | 10.0.400 | ✓ deterministic |
| NuGet / dotnet | Outdated, vulnerable & deprecated dependencies | 10.0.400 | ✓ deterministic |
| git / LibGit2Sharp | Churn hotspots, knowledge concentration, history | 2.43.0 · 0.31.0 | ✓ deterministic |
| gitleaks · semgrep · trivy | Secrets in history, SAST, CVEs, IaC & container, PII / GDPR | 1.86.0 · 0.69.3 | ✓ deterministic |
Run transparency — what happened this run
- D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
- D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.scala) and this repository declares an sbt build (repository root, 85 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
- D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
- D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (build.sbt), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict.
- D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
- D26 Project Cohesion — 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. `(repository root)` (14585 LoC, 393 module-visible types across 13 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
- D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
- D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `bench/src/main/scala/benchmarks/FenReaderBench.scala`, `bench/src/main/scala/benchmarks/FenWriterBench.scala`, `bench/src/main/scala/benchmarks/HashBench.scala`, `bench/src/main/scala/benchmarks/InsufficientMaterialBench.scala`, `bench/src/main/scala/benchmarks/PgnBench.scala`, … (+54 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
- C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
- C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
- P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
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
- 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.
- D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
- D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
- D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
- D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
- D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
- D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
- D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
- D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
- D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
- D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
- D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
- D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
- D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
- AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
- 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 Complexity
5 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Horde.hasInsufficientMaterial at 52. A further 1 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being Tiebreak.apply at 17 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: tiebreak/src/main/scala/Tiebreak.scala (Tiebreak.apply at 17). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
What to do
- Bring the 5 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with Horde.hasInsufficientMaterial (cyclomatic 52), BinaryFen.write (cyclomatic 39), BinaryFen.read (cyclomatic 34). — 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 5 together lifts Cyclomatic Complexity from 8.3 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
D2 · Cognitive Complexity
16 method(s) exceeded the cognitive complexity threshold of 15; the worst was Horde.hasInsufficientMaterial at 62.
What to do
- Bring the 2 bodies over 30 down to 30 or less in Cognitive Complexity — start with Horde.hasInsufficientMaterial (cognitive 62), Divider.score (cognitive 41). — 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 2 together lifts Cognitive Complexity from 7.2 to about 8.0/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
D3 · God Classes
1 god class(es) detected.
What to do
- Resolve the 1 TooManyMethods finding(s) in God Classes — start with Variant.scala. — One of this dimension's main actionable groups (1 warning-level).
D4 · Code Duplication
3 duplicated block group(s) detected. 1.4 % of the production lines (211 of 14,585) are in a reported copy. A further 11 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 1 of the 14 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.
What to do
- Resolve the 2 Edited copies of one member (3 members, 8+ corresponding lines) finding(s) in Code Duplication — start with Node.scala (2). — One of this dimension's main actionable groups (2 warning-level).
- Resolve the 2 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with Node.scala (2). — One of this dimension's main actionable groups (2 warning-level).
- Resolve the 1 Edited copy of a member (18 corresponding lines) finding(s) in Code Duplication — start with Node.scala. — One of this dimension's main actionable groups (1 warning-level).
D5 · Coupling
5 production modules (sbt), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 1 module(s) off the main sequence.
What to do
- Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
D6 · Cohesion (LCOM4)
0 of 7 classes have LCOM4 above 3.
D12 · Dependency Hygiene
0 outdated direct sbt declarations. 8 of 11 direct declarations were graded against Maven Central (3 not published there, which is what a private Nexus or Artifactory artifact looks like, 0 declaring a version range rather than an exact version). An sbt declaration names an EXACT version, so the remedy is an edit to the build file — there is no lockfile refresh that would move it. Test-, Provided- and it-scoped declarations are excluded, because a consumer of this project never receives them. A version held in a Scala val is read only when the val is one string literal: sbt is a program rather than a manifest, and evaluating a computed version would invent the measurement rather than take it. Whether any artifact is DEPRECATED or ABANDONED is not graded and cannot be — Maven Central publishes no such marker, and release age does not stand in for one: the most widely depended-upon libraries are routinely the stalest, being finished rather than abandoned. Known CVEs in this dependency graph are D30's question.
D13 · Secret Scanning
Secret scan ran and found no leaked secrets.
D14 · License Compliance
0 of 8 declared sbt dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the production coordinates this repository's 1 sbt build file(s) (build.sbt and project/*.scala) declare with a literal version, directly or through a string-literal val — `%%` resolved to the Scala binary suffix Central publishes under, test-scoped declarations excluded — the same declaration-site closure this analysis reads for dependency currency. sbt has no lockfile a checkout carries, so this is deliberately NOT the transitive closure. A further 3 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.
D15 · Churn × Complexity Hotspots
No churn × complexity hotspots in the window.
D16 · Bus Factor
20 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is core/src/main/scala/opening/OpeningDbPartC.scala. Counted over 60 of the 112 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What to do
- Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
- Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
D17 · Explicit Debt
5 deducted task-comment markers across 14585 LoC (0.0/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
What to do
- Resolve the 5 TodoComment finding(s) in Explicit Debt — start with Node.scala (2), Fixtures.scala, FenReader.scala. — One of this dimension's main actionable groups (5 warning-level).
D28 · Secrets (history)
gitleaks scanned the full history AND the current working tree and found no secrets.
D29 · Static Analysis (SAST)
10 finding(s): 0 critical, 10 high, 0 medium, 0 low. 9 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 53 file(s) — `bench/src/main/scala/benchmarks/FenReaderBench.scala`, `bench/src/main/scala/benchmarks/FenWriterBench.scala`, `bench/src/main/scala/benchmarks/HashBench.scala`, `bench/src/main/scala/benchmarks/InsufficientMaterialBench.scala`, `bench/src/main/scala/benchmarks/PgnBench.scala`, … (+48 more) — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
What to do
- Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
- No action in Static Analysis (SAST) — all 9 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (9 issue-level, 0 of them charged here).
D30 · Dependency Vulnerabilities
No known-vulnerable dependencies in any ecosystem this repository declares.
D34 · Knowledge Freshness
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 60 of the 112 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
D35 · Change Coupling
Strongest change-coupling: File.scala↔Rank.scala 80%
What to do
- Resolve the 1 Change coupling finding(s) in Change Coupling — start with File.scala. — One of this dimension's main actionable groups (1 warning-level).
D43 · Malicious Dependencies
No dependency in any ecosystem this repository declares is published as malicious.
D44 · Platform End-of-Life
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 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.
Frontend & cross-cutting dimensions
AX10 · Code composition
AX3 · Project dependency cycles
AX4 · Dependency direction
AX6 · Interface segregation
GD1 · Unfinished & placeholder code
IC1 · Incompleteness & stubs
M1 · Documentation (README)
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 documentation
- 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 structure
P1 · CI/CD gates
- A CI pipeline exists but no build step was matched — changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves.
What to do
- Add an explicit build step to your CI pipeline — your stack's own build command, or, if the pipeline delegates to a task runner, a build task that runner executes in CI — so every change is built before merge.
P10 · Library API & versioning
P2 · Observability
- No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
- Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling
What to do
- Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
- Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene
- No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
- Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF1 · Benchmark discipline
- A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — bench/src/main/scala/benchmarks/BinaryFenBench.scala
What to do
- Run JMH with the GC profiler (`-prof gc`, or addProfiler(GCProfiler.class)) so allocation rate regressions are visible, not just time.
X12 · Unreachable branch
X16 · Unfloored truncation loop
X21 · Side-effecting pattern guard
X27 · Collection changed while being enumerated
X3 · Exception handling
X30 · Support guard that admits what it rejects
X5 · Nullable reference types
- No build over this repository's 94 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
What to do
- On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
Reference — by lens
| Lens | Score | Rating | Impact |
|---|---|---|---|
| Code Health | 70% | Adequate — gated by X5 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Architecture | 98% | Exemplary | Strongest area. |
| Maturity | 52% | Adequate — gated by M2 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Readiness | 50% | Adequate — gated by P2 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Security | 95% | Exemplary | Solid. |
| Performance | 85% | Strong | Solid. |
Unscored — 1 check(s) recorded observations but carry no score
- D36 Supply-chain Provenance & Signing — 1 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
Not evidenced — 2 control(s) we could not find positive evidence for
- P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
- P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 72 check(s) not relevant to this codebase
- AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
- AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
- AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
- AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
- AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
- AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
- AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Scala imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
- AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance is shared between request threads.
- AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
- AX7 Slice cohesion — not applicable — not a vertical-slice architecture
- AX8 Test isolation — no test/production split to check
- AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
- AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
- C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
- C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
- C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
- C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
- C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
- D10 Test Quality — ~11058 lines of test source are present (.scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
- D11 Test Reliability — Test reliability not included — the .scala suite was found but not re-run
- D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
- D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
- 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.
- D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 3 candidate(s) found and not reported.
- D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
- D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
- D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, .scala, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
- D25 ADR Conformance — no ADRs to check
- D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
- D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
- D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
- D32 Data Compliance (PII/GDPR) — 59 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
- D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
- D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
- D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
- D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
- D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
- D8 Code Coverage — Coverage not included — suite not readable by the collector
- DM1 Domain Modelling — applicable but not scored (1 of 2 signals for this style — below the bar we score at): 126 value object(s)
- ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
- ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
- ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
- M4 Documentation accuracy — Not applicable: the 2 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'.
- P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, Python source, so there is no service whose uptime a failing dependency could take down
- P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
- P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
- PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
- PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
- S1 Web-Security Posture — No web surface: 94 Scala file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server artifact (akka-http, pekko-http, http4s, Play, Finagle, zio-http, cask, Scalatra, a tapir server, Jetty, Undertow, …) outside test scope in its build, and no server package imported or server bound in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
- X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
- 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
- X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X2 Cancellation propagation — no C# was loaded; this repository's Scala and Python were read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter; a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
- X20 Mistyped argument guard — 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
- 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 — 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 — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
- X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Scala was read, and it logs through none that an interpolated message defeats: scala-logging takes an `s"…"` message apart into SLF4J's pattern and arguments at compile time, and log4s, grizzled-slf4j, Play's Logger, Akka's LoggingAdapter, sbt's Logger and Spark's Logging take one finished message (as log4net does in C#). Calls made straight through SLF4J (`org.slf4j.Logger`) would be judged.
- 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)
Critical — 10 finding(s)
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
Serious — 45 finding(s)
- TodoComment test-kit/src/test/scala/format/pgn/Fixtures.scala:2135
- TodoComment core/src/main/scala/Node.scala:323
- TodoComment core/src/main/scala/Node.scala:505
- TodoComment core/src/main/scala/format/FenReader.scala:33
- TodoComment core/src/main/scala/format/pgn/Parser.scala:109
- Edited copies of one member (3 members, 8+ corresponding lines) core/src/main/scala/Node.scala:461
- Edited copies of one member (3 members, 8+ corresponding lines) core/src/main/scala/Node.scala:173
- Duplicated block (7 lines × 2) core/src/main/scala/Node.scala:224
- Duplicated block (7 lines × 2) core/src/main/scala/Node.scala:247
- Horde.hasInsufficientMaterial (cyclomatic 52) core/src/main/scala/variant/Horde.scala:93
- BinaryFen.write (cyclomatic 39) core/src/main/scala/format/BinaryFen.scala:185
- BinaryFen.read (cyclomatic 34) core/src/main/scala/format/BinaryFen.scala:12
- Divider.score (cyclomatic 26) core/src/main/scala/Divider.scala:50
- FenReader.makeBoardWithCrazyPromoted (cyclomatic 17) core/src/main/scala/format/FenReader.scala:150
- Horde.hasInsufficientMaterial (cognitive 62) core/src/main/scala/variant/Horde.scala:93
- Divider.score (cognitive 41) core/src/main/scala/Divider.scala:50
- Position.genPawn (cognitive 30) core/src/main/scala/Position.scala:200
- BinaryFen.write (cognitive 27) core/src/main/scala/format/BinaryFen.scala:185
- Position.genCastling (cognitive 24) core/src/main/scala/Position.scala:277
- FenWriter.writeCastles (cognitive 22) core/src/main/scala/format/FenWriter.scala:83
- FenReader.makeBoardWithCrazyPromoted (cognitive 21) core/src/main/scala/format/FenReader.scala:150
- FenWriter.writeBoard (cognitive 20) core/src/main/scala/format/FenWriter.scala:49
- Crazyhouse.legalDrops (cognitive 20) core/src/main/scala/variant/Crazyhouse.scala:120
- Position.castle (cognitive 19) core/src/main/scala/Position.scala:389
- FenReader.read (cognitive 18) core/src/main/scala/format/FenReader.scala:18
- BinaryFen.read (cognitive 17) core/src/main/scala/format/BinaryFen.scala:12
- Dumper.apply (cognitive 17) core/src/main/scala/format/pgn/Dumper.scala:6
- Hash.hashPosition (cognitive 16) core/src/main/scala/Hash.scala:35
- Move.castleRights (cognitive 16) core/src/main/scala/MoveOrDrop.scala:105
- Crazyhouse.drop (cognitive 16) core/src/main/scala/variant/Crazyhouse.scala:36
- TooManyMethods: Variant core/src/main/scala/variant/Variant.scala:11
- Change coupling: File.scala ↔ Rank.scala core/src/main/scala/File.scala:1
- REDACTED
- Edited copy of a member (18 corresponding lines) core/src/main/scala/Node.scala:224
- Edited copy of a member (8 corresponding lines) core/src/main/scala/Node.scala:347
- Edited copy of a member (6 corresponding lines) core/src/main/scala/Node.scala:326
- Edited copy of a member (17 corresponding lines) core/src/main/scala/Position.scala:334
- Edited copy of a member (7 corresponding lines) core/src/main/scala/ByRole.scala:14
- Edited copy of a member (4 corresponding lines) core/src/main/scala/Node.scala:311
- Edited copies of one member (3 members, 5+ corresponding lines) tiebreak/src/main/scala/Tiebreak.scala:159
- Edited copy of a member (5 corresponding lines) core/src/main/scala/ByRole.scala:46
- Duplicated block (6 lines × 2) core/src/main/scala/ByRole.scala:14
- Edited copy of a member (9 corresponding lines) test-kit/src/main/scala/chess/ChessTreeArbitraries.scala:42
- Off the main sequence: scalachess
- No structured logging
Minor — 9 finding(s)
- Off-boarding risk: anonymized user #1
- Off-boarding risk: anonymized user #2
- Further sole-owners (lower concentration)
- No ADRs
- No architecture diagram/doc
- CI build step not evidenced
- No changelog
- Benchmarks don't track allocations bench/src/main/scala/benchmarks/BinaryFenBench.scala
- Scala's null is not held to the type system everywhere
Appendix B — Reproduction & audit trail
| Dimension | Tool | Version | Command | Findings | Raw output |
|---|---|---|---|---|---|
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-749aecb6f93249c7b3ce49de7d289d72/history.json --exit-code 0 --source . | 0 | artifacts/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-749aecb6f93249c7b3ce49de7d289d72/tree.json --exit-code 0 --source . | 0 | artifacts/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 . | 10 | artifacts/raw/semgrep.json |
| D30 · Dependency Vulnerabilities | osv-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-720ece66bb204956b8a797371db22977 | 0 | artifacts/raw/osv-scanner.json |
| D31 · IaC & Container Security | trivy | — | trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan. | 0 | — |
| D32 · Data Compliance (PII/GDPR) | semgrep | — | semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 59 file(s) — `bench/src/main/scala/benchmarks/FenReaderBench.scala`, `bench/src/main/scala/benchmarks/FenWriterBench.scala`, `bench/src/main/scala/benchmarks/HashBench.scala`, `bench/src/main/scala/benchmarks/InsufficientMaterialBench.scala`, `bench/src/main/scala/benchmarks/PgnBench.scala`, … (+54 more) — so the PII/GDPR sweep did not cover them at all. | 0 | — |
| D37 · Vulnerability-disclosure Policy | disclosure | — | 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 Confinement | runtime-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 Confinement | runtime-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 Enforcement | runtime-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 Dependencies | osv-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-720ece66bb204956b8a797371db22977 | 0 | artifacts/raw/osv-scanner.json |