{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"WorkStealingRuntime.InterpretAsync (cyclomatic 37): WorkStealingRuntime.InterpretAsync has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb2ad09fd565bf56e99705ad55f6b2947dbdf838c5637c0b9c35cd3a6a13f5"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterCore.processRegionCont (cyclomatic 36): InterpreterCore.processRegionCont has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52f06ea118133b7f2c58f02292a802c3a9f407445290cfb4e453040f0bbf6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectRuntime.InterpretAsync (cyclomatic 34): DirectRuntime.InterpretAsync has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfec8c67e277c4e59b3a00401f8f349416eb622a482ca0817e29c0d651ffc4e"}},{"ruleId":"D1","level":"warning","message":{"text":"KestrelBridge.writeResponseWithOptions (cyclomatic 33): KestrelBridge.writeResponseWithOptions has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4bc8d0bbb1f683418b5183bd8a6ff1bba18d4c89d4cbc1a812bda3f5ffdfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterCore.handleSharedCase (cyclomatic 28): InterpreterCore.handleSharedCase has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dafb5d65dd4069b07b0520cd17df9d8c44cd0eeb5a8374283c95b34ba8a4ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"KestrelBridge.handleTracked (cyclomatic 24): KestrelBridge.handleTracked has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"876eb416e522e649e4bb04c846f60262dc6f98d8628f08481853bdcbb7f09052"}},{"ruleId":"D1","level":"warning","message":{"text":"FIOApp\u00602.RunAsync (cyclomatic 23): FIOApp\u00602.RunAsync has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/App.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe2d0f83e700f90dac8097515382e835eb735cb3c102d71a949e98646f1c217"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocket.ReceiveMessage (cyclomatic 20): WebSocket.ReceiveMessage has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2ea67697f6bfe5ec96d62bf93f59579419b6d65da2376ac75df1eda3f7d494"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocket.SendFrame (cyclomatic 19): WebSocket.SendFrame has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f70f91915bd2e580b44bcd58bb4c907061b69d0b1035c63450da6cdfde87828"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketServer.acceptLoop (cyclomatic 17): WebSocketServer.acceptLoop has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocketServer.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10bec150a5a6a64088ec6badae2c635825b8db1f60cc9a09696b65b0a2d7167"}},{"ruleId":"D1","level":"warning","message":{"text":"FIO.raceAll (cyclomatic 16): FIO.raceAll has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab9e61e6b5c16f42607a0bb40b2ad361eeaacdc024538c666e6d8440f01b2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectRuntime.InterpretAsync (cognitive 109): DirectRuntime.InterpretAsync has cognitive complexity 109 (threshold 15). Drivers by points: if/else 12 (42 pts), error handling 7 (38 pts), match/switch 5 (20 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58a9152d48caa640114d5e8ecd036bc497bb5c7a2bb89e4e9de2f22b7ed50f3"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkStealingRuntime.InterpretAsync (cognitive 104): WorkStealingRuntime.InterpretAsync has cognitive complexity 104 (threshold 15). Drivers by points: if/else 18 (64 pts), match/switch 7 (26 pts), loops 3 (13 pts), boolean chains 1 (nesting depth added 75). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2405dc53ea06752090dda763b6ada359ef0db3c5354abbb6af2b0890dc207704"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.handleTracked (cognitive 54): KestrelBridge.handleTracked has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 3 (11 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80298cfda94ce4eb144629ae229c41421f1976678f639279bd604ae64a58807"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterCore.processRegionCont (cognitive 41): InterpreterCore.processRegionCont has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 5 (11 pts), error handling 2 (6 pts), boolean chains 4 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"de63e59e7da675b4d7097b0f622cee7a08251f02310d4cf96af2dfda1d6e8a57"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.writeResponseWithOptions (cognitive 32): KestrelBridge.writeResponseWithOptions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c868582bff014ed28e0e5e4ed941e25084ba9da975f2249615c36e978499f6"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket.ReceiveMessage (cognitive 30): WebSocket.ReceiveMessage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e03de762ac02f579fa64e726b8045e1fb47accbc6c8551b488803acc72f0c02"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterCore.processOutcome (cognitive 29): InterpreterCore.processOutcome has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (11 pts), error handling 2 (10 pts), if/else 3 (7 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61177a3a8aded8d9a36ab41997a907916012146b482ee0c2d9f1f1c97541033"}},{"ruleId":"D2","level":"warning","message":{"text":"FIOApp\u00602.RunAsync (cognitive 25): FIOApp\u00602.RunAsync has cognitive complexity 25 (threshold 15). Drivers by points: error handling 8 (14 pts), if/else 5 (6 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/App.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8788f14772f7341b6440dc2a19b1b8580b12161458b83bcd3c15e268a948a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"FIO.raceAll (cognitive 24): FIO.raceAll has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 7 (10 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f161060221c48e4bc590c82ace67d547e23cc6243362a78ccd04930692694b70"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket.SendFrame (cognitive 24): WebSocket.SendFrame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101bfdb3862fa494e22153c83380d92d5f1d8025d0055a296fa901c8780814a"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.readBodyAsync (cognitive 21): KestrelBridge.readBodyAsync has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"459d63675f9df3281ad437a52a3f7569f1752857279cc46472bc1c0e9dd37694"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketServer.acceptLoop (cognitive 21): WebSocketServer.acceptLoop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (6 pts), boolean chains 3, error handling 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocketServer.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a8845fc12fb8eb8e87b26a67ff0743be81ed36986475b38a339bf762043d43"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterCore.handleSharedCase (cognitive 20): InterpreterCore.handleSharedCase has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (9 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf9925bc8601f832c1e00bef4552451490e5b2c0e33824f971299b0fa2434f3"}},{"ruleId":"D2","level":"warning","message":{"text":"KestrelBridge.convertRequestAsync (cognitive 20): KestrelBridge.convertRequestAsync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6e2dddc393ca08d507ee32c9d6d44fab351586c6d32bb057e9ac45ff32127b"}},{"ruleId":"D2","level":"warning","message":{"text":"FIO.forEachPar (cognitive 17): FIO.forEachPar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8946310e7336a57cb6380bd69b373e098160219f9f06756f531f10e920a75fe"}},{"ruleId":"D2","level":"warning","message":{"text":"FiberContext.RescheduleBlockingWorkItems (cognitive 17): FiberContext.RescheduleBlockingWorkItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 1 (4 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Core.fs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bfd4d5617ed6215e4e57dd9d56f56652d54240f56cb79c26e1d434beb1bc0f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Extensions: TooManyFunctions \u2014 75 functions. The bar is 30 functions; this is 45 over it, 2.50\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90f2b4bb342f5d8b30f9f0efa073191d2a53fa8d21fb0b587f3a906e99cd101"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: FIO: TooManyFunctions \u2014 58 functions. The bar is 30 functions; this is 28 over it, 1.93\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0fc928c79301a0b581424b047057f98e1e40996a137b53f4d9de4a480cdb7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: DSL/Core.fs: FileTooLong \u2014 908 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 408 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Core.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cfd501114c9836e53b914da2a7a9b0ca8d84d7363419db59cfb65273672fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FIO.WebSockets/WebSocket.fs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"636f8905f5e461dc81e3800ed61d7afe271cfa1d3b0ca29b8bf45e90ecd34eae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Runtime/InterpreterCore.fs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e2ab7f9890ea84d4efe556be7ce9506a95eaa4e47a9d1094b48c2b9a2a8ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebSocket: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7251ec2ba2ef816f13fc1a86c0219156d0cebf7d12e4a9ae0e6b59e6f1c8d23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/FIO.WebSockets/WebSocket.fs:264-273 | src/FIO.WebSockets/WebSocket.fs:415-423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d536adcfbb67345a40f7fc64c4d33ba5c291701d009ccd4699e801bc5c35b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FIO/DSL/Extensions.fs:481-489 | src/FIO/DSL/Extensions.fs:499-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24103af4a5807f65a4facd27522f2527958cafcb05ca4e22ceb922b11a0d36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FIO/DSL/Factories.fs:459-465 | src/FIO/DSL/Factories.fs:466-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"abad9fa54cad8a0bc44676fe9c7c5760de959ca8222b8c15457618a4f1f6c953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FIO/DSL/Factories.fs:172-178 | src/FIO/DSL/Factories.fs:202-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FIO/DSL/Factories.fs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2a56f13538b2a3cc630fd0c3632a3bfa46ef1aa908fdbb6ba03321054ddac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FIO/Runtime/DirectRuntime.fs:217-222 | src/FIO/Runtime/WorkStealingRuntime.fs:562-567 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FIO/Runtime/DirectRuntime.fs:217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4644f0098f59e4624db67987cd4f72baec1f428196bb81839f69ce70514e2606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/FIO/DSL/Extensions.fs:252-257 | src/FIO/DSL/Extensions.fs:260-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e78f969660a8a623a9fd266253fdcb85aafce6b09c594d2a9f5b90eb75c91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FIO/DSL/Extensions.fs:281-285 | src/FIO/DSL/Extensions.fs:505-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e8a0a6fa18872c9f0e58981cb7e3d02b4a6ab47a57a0341752699ce322910c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FIO.Http/Middleware.fs:139-148 | src/FIO.Http/Middleware.fs:171-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/FIO.Http/Middleware.fs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/Middleware.fs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"546dc457fa0d50430a915425008c0cb9095d61f1a874e96e2c2db26f1defd0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FIO/DSL/Extensions.fs:238-245 | src/FIO/DSL/Extensions.fs:270-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Extensions.fs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dfda832557a81c24fc35e4653bd32bf58f0a3730fa5ecd1ab835fffde924b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/FIO.Examples.DSL/Program.fs:16-26 | examples/FIO.Examples.DSL/Program.fs:30-40 | examples/FIO.Examples.DSL/Program.fs:58-68 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/FIO.Examples.DSL/Program.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca4d6be6e7568a21047290c51b3e02b85871129d73ea315872592356f9abbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/FIO.Examples.App/Program.fs:227-241 | examples/FIO.Examples.App/Program.fs:252-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/FIO.Examples.App/Program.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e440d4e719b2392bea18d9aa8ff05f8dae22b5d86e413a96f38a123e2bedf6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Scheduler (LCOM4 4): Scheduler\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2789fd210a68251273e97ba33e6803f0e780b41ea2212c2a298eb350d012603"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/WorkStealingRuntime.fs: src/FIO/Runtime/WorkStealingRuntime.fs changed 4 times in last 90 days, max cyclomatic complexity 37 in WorkStealingRuntime.InterpretAsync at line 332. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO/Runtime/WorkStealingRuntime.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/WorkStealingRuntime.fs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"91729cb2c5fad02316e576dff00508ea7b09451169eec353dfcd4225d4f651c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/InterpreterCore.fs: src/FIO/Runtime/InterpreterCore.fs changed 4 times in last 90 days, max cyclomatic complexity 36 in InterpreterCore.processRegionCont at line 100. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO/Runtime/InterpreterCore.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/InterpreterCore.fs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22589c464a1b813b72a4ffa2aa2c6c999c5651f7eae544def95a93f57d39738"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/Runtime/DirectRuntime.fs: src/FIO/Runtime/DirectRuntime.fs changed 4 times in last 90 days, max cyclomatic complexity 34 in DirectRuntime.InterpretAsync at line 18. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO/Runtime/DirectRuntime.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/Runtime/DirectRuntime.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f343c7c25af1cde6da0dd50fc60c12d1dae75b520d8d59764fa284af195cf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO.Http/KestrelBridge.fs: src/FIO.Http/KestrelBridge.fs changed 4 times in last 90 days, max cyclomatic complexity 33 in KestrelBridge.writeResponseWithOptions at line 228. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO.Http/KestrelBridge.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.Http/KestrelBridge.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92237e64b775b927eb799a41d49cf5bafd91bc39a01d9265b28fb85f7fd94fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO.WebSockets/WebSocket.fs: src/FIO.WebSockets/WebSocket.fs changed 5 times in last 90 days, max cyclomatic complexity 20 in WebSocket.ReceiveMessage at line 204. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO.WebSockets/WebSocket.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocket.fs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5a6d1db4fad00080a775bdfe91ba7c2c2d3797cc430d7faeae7376c1e0c885"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/App.fs: src/FIO/App.fs changed 4 times in last 90 days, max cyclomatic complexity 23 in FIOApp\u00602.RunAsync at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO/App.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/App.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d2905367f0a2a8d787e5e6c1507f7aa10710d10ff89d740ed5cf4522a261d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO.WebSockets/WebSocketServer.fs: src/FIO.WebSockets/WebSocketServer.fs changed 5 times in last 90 days, max cyclomatic complexity 17 in WebSocketServer.acceptLoop at line 184. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO.WebSockets/WebSocketServer.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO.WebSockets/WebSocketServer.fs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbd29313b1ad2a0a2965db1bd0240b58df84df9eb65214741d2af362f5f9a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/FIO/DSL/Factories.fs: src/FIO/DSL/Factories.fs changed 5 times in last 90 days, max cyclomatic complexity 16 in FIO.raceAll at line 503. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:41:15 \u002B01:00\u0027 --until=\u00272026-11-13 20:41:15 \u002B01:00\u0027 --full-history --no-merges -- src/FIO/DSL/Factories.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FIO/DSL/Factories.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f27ed6021dbc25f00a87a23bd93480b67725b508327b27d7cb80572faceebed"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 86 % of calls cross a namespace and only 36 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96d8c274d70d3b4d3a1cf8d627b9f599cc78283b06e585552cd0c3715e8daa9b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/benchmark.yml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A F#/VB BenchmarkDotNet suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/FIO.Benchmarks/Benchmarks/FIOBenchmark.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd111479d13b7cd4eb11d01f461621d860e2cca2ac5091b575de168fa2e1f2c0"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":7,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}