{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","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-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"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":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"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":"Engine.run (cyclomatic 87): Engine.run has cyclomatic complexity 87 (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/Attractor/Engine.fs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"da293d80908230d8d8955cb297b469a6af572e3a6c1d93e43db104e6fdfc1e25"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIAdapter.UnifiedLlm.IProviderAdapter.Stream (cyclomatic 80): OpenAIAdapter.UnifiedLlm.IProviderAdapter.Stream has cyclomatic complexity 80 (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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d138ebfd9f786ce9a87cffb1e7e13ab54f8663ac2001395d2d18110bb96407c"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.create (cyclomatic 65): Client.create has cyclomatic complexity 65 (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/AcpRuntime/Client.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d8475756e82b41357191a5e2530940df1dece07f38447767cfcccd574d3fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.resumeFromCheckpoint (cyclomatic 58): Engine.resumeFromCheckpoint has cyclomatic complexity 58 (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/Attractor/Engine.fs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4478bbcd483db5a9a73c2f91475106e48c0e74a77c0d13132fbd9f72a8689ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.createServerWithTransport (cyclomatic 52): Server.createServerWithTransport has cyclomatic complexity 52 (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/McpClient/Server.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaeb9b76e2e97a1c4de5b27edfde7d8b576c488f6b7cefddeba69f603c8c3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicAdapter.UnifiedLlm.IProviderAdapter.Stream (cyclomatic 45): AnthropicAdapter.UnifiedLlm.IProviderAdapter.Stream has cyclomatic complexity 45 (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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf33120c4a73572930dfa4170db314abde28a1f0bba4b6a67fc41e871725b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Validation.generateSynopsis (cyclomatic 39): Validation.generateSynopsis has cyclomatic complexity 39 (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/Attractor/Validation.fs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6a5e7b344265efc36476d53a943551fef0536b05eadfb12a65d3060bcf3b43"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenRouterAdapter.UnifiedLlm.IProviderAdapter.Stream (cyclomatic 39): OpenRouterAdapter.UnifiedLlm.IProviderAdapter.Stream has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":3252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4459683704e97b48a9bb4b17453c540129136d3653c5e7f9094d7e67e6b4c66a"}},{"ruleId":"D1","level":"warning","message":{"text":"PatchApplier.applyPatch (cyclomatic 38): PatchApplier.applyPatch has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CodingAgent/Session.fs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45ee6420a367398fabac38c5c2c3e66d8142dc64c4029387eed865934ffd2d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodingAgentHandler.Attractor.IHandler.Execute (cyclomatic 37): CodingAgentHandler.Attractor.IHandler.Execute 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/Attractor/Handlers.fs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4c725b0f4423ce076023e51cee46da79df2019b74e021d85b26bf43ed3fdd8"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsoleInterviewer.Attractor.IInterviewer.Ask (cyclomatic 37): ConsoleInterviewer.Attractor.IInterviewer.Ask has cyclomatic complexity 37 (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/Attractor/Interviewer.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d95c73760e2abddb17d6d54fa5d8ef7b27322f14c50f98e847a1831c988743a"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultDelegate.createDefaultDelegate (cyclomatic 36): DefaultDelegate.createDefaultDelegate 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/AcpRuntime/DefaultDelegate.fs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c69b54cc3d906fc42ef9f2691dac59ce3b1272fca48db0a4a14281b82b4c12"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.serve (cyclomatic 34): Program.serve has cyclomatic complexity 34 (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/Attractor.Cli/Program.fs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a7f85c327448a46f8fd6953e001bd039867d9e014a27dec613593046f21b46"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestValidatorModule.fromCatalog (cyclomatic 34): RequestValidatorModule.fromCatalog 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/UnifiedLlm/Validation.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"074cd77eae2030efc7edf353ee5fce8827b4d2166323f6190c96515a2dbd65b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.createStdioTransport (cyclomatic 31): Transport.createStdioTransport has cyclomatic complexity 31 (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/AcpRuntime/Transport.fs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa07fb1ddfd68e6f4fdd0bbf35dcde3e039d27a65e4a9372be8afc0cbf5bdddb"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiAdapter.UnifiedLlm.IProviderAdapter.Stream (cyclomatic 31): GeminiAdapter.UnifiedLlm.IProviderAdapter.Stream has cyclomatic complexity 31 (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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3be035baa0bd9593c593c70ed755391e329910541437fc7840190349016f54"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.createHttpSseTransport (cyclomatic 28): Transport.createHttpSseTransport has cyclomatic complexity 28 (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/AcpRuntime/Transport.fs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0d4d4fe2e479b7a974130ecd4c2dd1660eb2cd1e75b182cc7ec1abc46c4934"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.dispatch (cyclomatic 27): Checkpoint.dispatch has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3632fec7105eda2b474dc0d974fbd9ec44dca101f0c68359a4f3995055f53749"}},{"ruleId":"D1","level":"warning","message":{"text":"Codec.decode (cyclomatic 26): Codec.decode has cyclomatic complexity 26 (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/JsonRpc/Codec.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1badc1a43ddbbab6939c23b63d61f32656bee83e2b79ff1d7345752f305a254a"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheStoreModule.fileSystem (cyclomatic 26): CacheStoreModule.fileSystem has cyclomatic complexity 26 (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/UnifiedLlm/Caching.fs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"191329f30c41225bfa80b7b120cc289ac6a5d25e5d5ab09d8127dd2ccfd6bd21"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmBackend.Attractor.ICodergenBackend.Run (cyclomatic 25): LlmBackend.Attractor.ICodergenBackend.Run has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b2a41b1651e57bc6fc7c055fede36bd78e5d992b1f5a4ac210eca0ac991e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.tokenize (cyclomatic 25): Lexer.tokenize has cyclomatic complexity 25 (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/Attractor/DotParser.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8553439949219cedf0ede50d468101e442fd5edbc0cc869bb6b96fc9b8a3c1d8"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpAdapterHelpers.responseFromOpenAI (cyclomatic 25): HttpAdapterHelpers.responseFromOpenAI has cyclomatic complexity 25 (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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"41270b3367fe99f303ab22899806c58644cc7c1514dd692e92a001153c9c6c32"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.createStdioTransport (cyclomatic 25): Transport.createStdioTransport has cyclomatic complexity 25 (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/McpClient/Transport.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f4d82e38534ee335698495a1798b69e5f744c7d5bb4b0c9942f0b1b48d03a"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.parseSseStreamWithIdleTimeout (cyclomatic 24): Transport.parseSseStreamWithIdleTimeout 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/AcpRuntime/Transport.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"92677c843611ed464188fde1d7a82de077ae97bd9b21c5af830bdbfd9ac32c06"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.parseArgs (cyclomatic 24): Program.parseArgs has cyclomatic complexity 24 (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/Attractor.Cli/Program.fs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b39b3b0adaea5eb5e64147cf315865e68ca070b763cede7afc002e378b6000"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.Project (cyclomatic 24): Context.Project 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/Attractor/Types.fs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57f20fdbfa5f51d27d2ba6f2325535c6a67815285cfc83b50d2955ad10b2c39"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.parseSseStreamWithIdleTimeout (cyclomatic 24): Transport.parseSseStreamWithIdleTimeout 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/McpClient/Transport.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a02ada3c879af26126bd273915304e136436adea83009f8c92a09d3b07947ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsoleEventObserver.Attractor.IEventObserver.OnEvent (cyclomatic 23): ConsoleEventObserver.Attractor.IEventObserver.OnEvent has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fcc14a68072b4762699e5c386928462724c494b81f5da32d8dd5a7c237dfac"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.readNumber (cyclomatic 23): Lexer.readNumber has cyclomatic complexity 23 (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/Attractor/DotParser.fs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3059db9b314aef9d868e02ef570d8e7ac017cb95a606efd2c28b5daf7acbd69d"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.ProcessInput (cyclomatic 23): Session.ProcessInput has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CodingAgent/Session.fs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"63935393c9a55049a6f4f4c1f2c2538ef961fda4b839c02801b75d899e5a830e"}},{"ruleId":"D1","level":"warning","message":{"text":"Generation.generateInternal (cyclomatic 23): Generation.generateInternal 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/UnifiedLlm/Generation.fs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"113def96896b9036617850b3bb55f733258316882e0c4ebefa26df34df0e5bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.createHttpSseTransport (cyclomatic 23): Transport.createHttpSseTransport has cyclomatic complexity 23 (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/McpClient/Transport.fs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"341a728b9921de0113f4b9356635fbe317889d96d007e8cc8447c37eb5698c52"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport.createWebSocketTransport (cyclomatic 22): Transport.createWebSocketTransport has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a70f45963f8670c9ef56227076b4580c0e2b9c0ceec6c37708127e96402648"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.main (cyclomatic 22): Program.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"10670a5960a9b05bbbee7d65cacd5f07e8131272a434b8ff1c41930052178075"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.Attractor.IHandler.Execute (cyclomatic 22): ToolHandler.Attractor.IHandler.Execute has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Handlers.fs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2303923a7ca10f23597c94efaa1b81e4687c5813a387e8b855e71572673c1d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"WaitForHumanHandler.Attractor.IHandler.Execute (cyclomatic 21): WaitForHumanHandler.Attractor.IHandler.Execute has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Handlers.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1bb855f3ab3ad368eeab13fda65f4c79b72926cd61f332fd2d2d9132486fc"}},{"ruleId":"D1","level":"warning","message":{"text":"McpToolHandler.Attractor.IHandler.Execute (cyclomatic 21): McpToolHandler.Attractor.IHandler.Execute has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/Attractor/McpHandlers.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"300252c25a1e96ff5f48ad7397454da3b5284a8e816cde50f068f7d29550a862"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpAdapterHelpers.responseFromGemini (cyclomatic 20): HttpAdapterHelpers.responseFromGemini has cyclomatic complexity 20 (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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db3ad769d1dda5d9053a53d81343f7be613ee2a855a40c2925254c1c668ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.stripComments (cyclomatic 19): Lexer.stripComments has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/DotParser.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4203e51da423c0dbd548d87595b5d03a5de54abb02b203df9fc409163fc4246b"}},{"ruleId":"D1","level":"warning","message":{"text":"DotParser.buildGraph (cyclomatic 19): DotParser.buildGraph has cyclomatic complexity 19 (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/Attractor/DotParser.fs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc18494632daf3af83eba8855cb2afde104bea382f969e95f080fab5824ab99f"}},{"ruleId":"D1","level":"warning","message":{"text":"Generation.streamWithControl (cyclomatic 19): Generation.streamWithControl has cyclomatic complexity 19 (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/UnifiedLlm/Generation.fs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b23f7d07410181a418e6b18231dff125cc54ac263ad84140a94ef18f7da93e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.executeWithRetry (cyclomatic 18): Engine.executeWithRetry has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ceb30d86b829736a21b3b6c1b92631a48faaf36ed5e0d369e3a3e5cc84543"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextPrompt.preparePromptContext (cyclomatic 17): ContextPrompt.preparePromptContext has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/ContextPrompt.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b65f92a5f8712d22bbb92b15f7ee03c15203f12e3a8d762da4422da00dc9d86"}},{"ruleId":"D1","level":"warning","message":{"text":"ledger.main (cyclomatic 17): ledger.main has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/sprints/ledger.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d070289acaa5948e9291c89ebb619b2d595114426c26a9fc355b97475d4d7a49"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.setOutcome (cyclomatic 16): Checkpoint.setOutcome 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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2913d0f13e6f05e6061cadf131e3fee199467ee2f9df3ba66182572544d4c0"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.Grep (cyclomatic 16): LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.Grep has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CodingAgent/ExecutionEnvironment.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ab5dbd18e297bb2ab91702f0e1c48a03686689561999fc8d3e1358e05c7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SseParsing.parseWithIdleTimeout (cyclomatic 16): SseParsing.parseWithIdleTimeout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6dff268316dede36d85565054201f269b239a735333161f1af701572730c24"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.run (cognitive 309): Engine.run has cognitive complexity 309 (threshold 15). Drivers by points: if/else 58 (184 pts), match/switch 23 (105 pts), boolean chains 11, loops 2 (9 pts) (nesting depth added 215). 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/Attractor/Engine.fs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0311cc2bb8b2ff14c92263d8cf49d83d211094bc763956d10bc2b4b5c7a6f794"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIAdapter.UnifiedLlm.IProviderAdapter.Stream (cognitive 180): OpenAIAdapter.UnifiedLlm.IProviderAdapter.Stream has cognitive complexity 180 (threshold 15). Drivers by points: if/else 30 (118 pts), match/switch 9 (39 pts), boolean chains 9, loops 3 (9 pts), error handling 1 (5 pts) (nesting depth added 128). 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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1011e494d22cee30fb7025226f7b72ec770b0002e32f49931dc10b6d282993b9"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenRouterAdapter.UnifiedLlm.IProviderAdapter.Stream (cognitive 145): OpenRouterAdapter.UnifiedLlm.IProviderAdapter.Stream has cognitive complexity 145 (threshold 15). Drivers by points: if/else 27 (82 pts), match/switch 9 (48 pts), loops 6 (15 pts) (nesting depth added 103). 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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":3252}}}],"partialFingerprints":{"codehealthFindingId/v1":"557ac4d17486510a1de6b599c7ff4c3b4dcf5e8965f5e8d2da6a5188a8a7224c"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.resumeFromCheckpoint (cognitive 126): Engine.resumeFromCheckpoint has cognitive complexity 126 (threshold 15). Drivers by points: match/switch 15 (60 pts), if/else 28 (56 pts), loops 6, boolean chains 4 (nesting depth added 73). 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/Attractor/Engine.fs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7470cd3cf58d3e38c1379bb1513df05ae1a02eb9159bb74eabd9a5b1ae09f5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicAdapter.UnifiedLlm.IProviderAdapter.Stream (cognitive 116): AnthropicAdapter.UnifiedLlm.IProviderAdapter.Stream has cognitive complexity 116 (threshold 15). Drivers by points: if/else 17 (70 pts), match/switch 10 (44 pts), boolean chains 1, loops 1 (nesting depth added 87). 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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"362fe39eac1b93992af8ad66f98b03e1eb5b5ca557961d5240395c322cf99a91"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiAdapter.UnifiedLlm.IProviderAdapter.Stream (cognitive 104): GeminiAdapter.UnifiedLlm.IProviderAdapter.Stream has cognitive complexity 104 (threshold 15). Drivers by points: if/else 14 (51 pts), match/switch 8 (46 pts), loops 3 (7 pts) (nesting depth added 79). 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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3181a5a5a356a82bc5d97ddf6bc140296dd449bf5e82344b182cafffda91f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.create (cognitive 90): Client.create has cognitive complexity 90 (threshold 15). Drivers by points: match/switch 25 (81 pts), if/else 2 (6 pts), loops 1 (3 pts) (nesting depth added 62). 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/AcpRuntime/Client.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcb760e2bca5cfff2b63a15b2e806d82b548446f0a2d8da2e6ab7ec9401f979"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchApplier.applyPatch (cognitive 88): PatchApplier.applyPatch has cognitive complexity 88 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 11 (34 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 50). 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/CodingAgent/Session.fs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bedccd97c2ebb01197ef57b585fc60d02b950b8bbbdce3e7094716478686e86"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.createServerWithTransport (cognitive 79): Server.createServerWithTransport has cognitive complexity 79 (threshold 15). Drivers by points: match/switch 22 (69 pts), if/else 3 (8 pts), boolean chains 2 (nesting depth added 52). 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/McpClient/Server.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"317ad773c3be291e6cdb6e32ca331771977460b740c2dd2e8806464fefbc7aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.executeWithRetry (cognitive 76): Engine.executeWithRetry has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (64 pts), loops 2 (7 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 49). 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/Attractor/Engine.fs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720648267b2bb6646a8eceb43b237fed6d932019e029fe7eac6a2bd10040410"}},{"ruleId":"D2","level":"warning","message":{"text":"CodingAgentHandler.Attractor.IHandler.Execute (cognitive 69): CodingAgentHandler.Attractor.IHandler.Execute has cognitive complexity 69 (threshold 15). Drivers by points: if/else 32 (50 pts), match/switch 3 (7 pts), boolean chains 6, error handling 3 (6 pts) (nesting depth added 25). 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/Attractor/Handlers.fs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fd9d963622362d1be6b7b44be5e3afdc46844e9c47472651d9a972fb183ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.createStdioTransport (cognitive 63): Transport.createStdioTransport has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (40 pts), error handling 6 (14 pts), match/switch 6 (8 pts), boolean chains 1 (nesting depth added 32). 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/AcpRuntime/Transport.fs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c233aad06dc5d4e1987c1713bd189c784d46f91526e17f18e343a1cd3a46ce"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultDelegate.createDefaultDelegate (cognitive 59): DefaultDelegate.createDefaultDelegate has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 14 (22 pts), loops 2 (7 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 29). 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/AcpRuntime/DefaultDelegate.fs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0699a7fe469f64f0e00e9cfd4173cea17137b192db38cf31c0033b8caeb59345"}},{"ruleId":"D2","level":"warning","message":{"text":"McpToolHandler.Attractor.IHandler.Execute (cognitive 58): McpToolHandler.Attractor.IHandler.Execute has cognitive complexity 58 (threshold 15). Drivers by points: match/switch 8 (38 pts), if/else 7 (20 pts) (nesting depth added 43). 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/Attractor/McpHandlers.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17299a6d0ed6c8cee3b1ce3070baef0236d9fef732d52182b9d957dd23373a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.Attractor.IHandler.Execute (cognitive 56): ToolHandler.Attractor.IHandler.Execute has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 5 (16 pts), error handling 2 (6 pts), loops 1 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Handlers.fs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"778bd843a6f4ad0437abcf6f1c7f1db8cf432cab1016c7f168eba37962d9d37f"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.dispatch (cognitive 54): Checkpoint.dispatch has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 6 (22 pts), loops 2 (6 pts) (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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6442d5a720b0a6242102f7dd2a1cd3bfc8a563f59031df41670b84e5aeddff"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitForHumanHandler.Attractor.IHandler.Execute (cognitive 54): WaitForHumanHandler.Attractor.IHandler.Execute has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (43 pts), error handling 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 25). 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/Attractor/Handlers.fs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c7976fa6d335e8a40b6a90337549f68507f912b733d6b5f19a376ba952fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Codec.decode (cognitive 49): Codec.decode has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (38 pts), if/else 4 (8 pts), error handling 3 (nesting depth added 33). 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/JsonRpc/Codec.fs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aca6ef587b3df4ce8f2b2accb40a785d9e8d85110f8b68122d6e498c004ad54"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsoleInterviewer.Attractor.IInterviewer.Ask (cognitive 49): ConsoleInterviewer.Attractor.IInterviewer.Ask has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 6 (13 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 16). 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/Attractor/Interviewer.fs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4be296bd9ad2fbefda2cb7a78c00637eddfe072d5aceebfb4478b8b0b6130a"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestValidatorModule.fromCatalog (cognitive 49): RequestValidatorModule.fromCatalog has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 8 (16 pts), boolean chains 8, loops 2 (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/UnifiedLlm/Validation.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cd64e7c47a6f107849fdc8d16970fd85736e50cb596b00edd0d0de9df162ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.createStdioTransport (cognitive 48): Transport.createStdioTransport has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (28 pts), error handling 5 (12 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/McpClient/Transport.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"22213b5a829ad27e8f8c1c52bc12f75e154a11e982e478956e10e1f8d2d698bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ProcessInput (cognitive 47): Session.ProcessInput has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 7, match/switch 1 (3 pts), loops 1 (nesting depth added 21). 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/CodingAgent/Session.fs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efc97ddc287ddecde5ea31c162fc61b720e6ac3b4c2516ba8cabe2e4a699666"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.serve (cognitive 46): Program.serve has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 8 (14 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 22). 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/Attractor.Cli/Program.fs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"676d4e3c3810e6c3b91a301c2ee1bb9b3833a1afeec3cd0d80a333accb98cb86"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.main (cognitive 46): Program.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (31 pts), error handling 3 (9 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4657f67639805bd8b00e7b00e922acde3b1f1eaf0ea6c010cc2402d292d9e221"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.parseSseStreamWithIdleTimeout (cognitive 45): Transport.parseSseStreamWithIdleTimeout has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 3 (10 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9653f137e7077e89b69f8277f292c02233e9b1f404cea9cdca4d1b28a2f72aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.loadCheckpoint (cognitive 45): Engine.loadCheckpoint has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 1 (4 pts), error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9fb5953cdc9173cdd935479226b7cddd5a603ec341a0a664ed688dae67a5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.parseSseStreamWithIdleTimeout (cognitive 45): Transport.parseSseStreamWithIdleTimeout has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 3 (10 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/McpClient/Transport.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb7d539d6ba6cdbe36462a282cec2aa50d53b12a6b976978ade4ae31690be5"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheStoreModule.fileSystem (cognitive 44): CacheStoreModule.fileSystem has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 10 (13 pts), error handling 2 (9 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/Caching.fs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f3f495442cefe422f41f308fb0b7a0851f165a4a344b6c33fcd777e39d209"}},{"ruleId":"D2","level":"warning","message":{"text":"Validation.generateSynopsis (cognitive 43): Validation.generateSynopsis has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 9, loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 7). 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/Attractor/Validation.fs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c613e5baf667127c1935bea2f51ea7d7f47be7d454553adc2589a67552ade208"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpAdapterHelpers.responseFromGemini (cognitive 43): HttpAdapterHelpers.responseFromGemini has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 9 (38 pts), loops 1 (3 pts), if/else 2 (nesting depth added 31). 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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afa5403d1161d5a57f27997371c4c8f87787cd64971f45bcaa24faeb7033bad"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextPrompt.preparePromptContext (cognitive 39): ContextPrompt.preparePromptContext has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/ContextPrompt.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4bb4b981e8c2d63b0f22d3385e4f618d036a75870b0d9c1c9142c5a4a92987"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.createHttpSseTransport (cognitive 38): Transport.createHttpSseTransport has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 4 (5 pts), loops 2 (3 pts), boolean chains 2, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e41721f9906ea0f3d6df462fcf6ab31cd9956811bf302983a7c68ba0468f60"}},{"ruleId":"D2","level":"warning","message":{"text":"Generation.validateJsonAgainstSchema (cognitive 36): Generation.validateJsonAgainstSchema has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 2 (5 pts) (nesting depth added 22). 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/UnifiedLlm/Generation.fs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38a248ddd4359f0b62610b50634b2a5a0609e1d9cc8aff645d49dc6ce43492b"}},{"ruleId":"D2","level":"warning","message":{"text":"EdgeSelection.selectEdge (cognitive 35): EdgeSelection.selectEdge has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 20). 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/Attractor/Engine.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4d165ed10375a4bf3e0e5dac0db620fb19c32f9bd64c827a8564791a790b34"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmBackend.Attractor.ICodergenBackend.Run (cognitive 34): LlmBackend.Attractor.ICodergenBackend.Run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 5 (11 pts), error handling 3, boolean chains 2 (nesting depth added 8). 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/Attractor.Cli/Program.fs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e8ef15ccaa432d805ec13a0f340c89c92691b80ce8cddf4648c72bbf1bc8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.Project (cognitive 34): Context.Project has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5 (9 pts), boolean chains 2, match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Types.fs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c399491d0e7d2b24260787a0a8c583f0426309c3c234871f7c6d9168c6c173b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generation.generateInternal (cognitive 34): Generation.generateInternal has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3 (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/UnifiedLlm/Generation.fs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd8b6de4ae543bb84676db5dcf255113f8b4ca5a754523556f117daf02ad08a"}},{"ruleId":"D2","level":"warning","message":{"text":"Conditions.validate (cognitive 33): Conditions.validate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 19). 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/Attractor/Conditions.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8221c42bcb009979a283a6e047a3d7b8345a36334053bc582f7a1b7a2a563d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SseParsing.parseWithIdleTimeout (cognitive 33): SseParsing.parseWithIdleTimeout has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (30 pts), error handling 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be1a9d1a7b4a045767a5a565cb488b6cccc4778d7975179d864108a31c070fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.executePrimaryWithRetry (cognitive 31): Engine.executePrimaryWithRetry has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc0a78650e7439adc05acc9bf543ba9e4479784a38d89a32d4bab4fde5c31e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Generation.validateToolArguments (cognitive 31): Generation.validateToolArguments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 1 (nesting depth added 15). 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/UnifiedLlm/Generation.fs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"4270cb9e27bb5ac9cd7c6e2fc13a6d221663ea03692356a24e7c247111bcb623"}},{"ruleId":"D2","level":"warning","message":{"text":"DotParser.buildGraph (cognitive 30): DotParser.buildGraph has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 4 (10 pts), if/else 3 (9 pts) (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/Attractor/DotParser.fs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac922aa880713b09c16c1729a4596e8de1731d43181ebf915cd1a4c3f81e9d52"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.createWebSocketTransport (cognitive 29): Transport.createWebSocketTransport has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 6 (8 pts), error handling 2 (4 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). 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/AcpRuntime/Transport.fs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d4c80b64cf270e4ae8706fd253507bcaa8cebf8c26ceb1615106324a81e6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generation.streamWithControl (cognitive 29): Generation.streamWithControl has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (21 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 18). 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/UnifiedLlm/Generation.fs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ff636f0f7f56d06090a658f85f2c810c5822c4c80b80daa104d626dbe52294"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.setOutcome (cognitive 28): Checkpoint.setOutcome has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (25 pts), if/else 2 (3 pts) (nesting depth added 18). 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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30893480926f3885cb2727b074cad3f77b0a421395e9e07fb5068e77dd9f98a"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.stripComments (cognitive 27): Lexer.stripComments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (7 pts), boolean chains 6 (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/Attractor/DotParser.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f935bbd96f326359c36acb7754de41f50d1aa9eac63360e2c12e131665fce63"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.createHttpSseTransport (cognitive 27): Transport.createHttpSseTransport has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 4 (5 pts), error handling 2, boolean chains 1, loops 1 (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/McpClient/Transport.fs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58c462fd23ee024ad74fc46b79bf0b465dbfa49dba873133d103c0de0668f15"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpHandlers.buildEndpoint (cognitive 26): AcpHandlers.buildEndpoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/AcpHandlers.fs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed02321d5d53f8d4e09df25cb6302be26caa266e2f19cd5352872ed81510b770"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.readNumber (cognitive 26): Lexer.readNumber has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 9, loops 2 (3 pts) (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/Attractor/DotParser.fs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"952acb67486ced170e39d22c1937e91dcfb720d3ad5ee79f535ffd80bc846c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Retry.executeWithHooks (cognitive 24): Retry.executeWithHooks has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (5 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 14). 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/UnifiedLlm/Retry.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f26548d1f73d6fd749f8a5b2576f3da595836415eefe35e0982fb07b9996a"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.markDone (cognitive 23): Checkpoint.markDone has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (11 pts) (nesting depth added 13). 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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff7afd66868fa520a06c6fba14db7b6f98c099b204c6d74d11c1faa171081f2"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpAdapterHelpers.responseFromOpenAI (cognitive 23): HttpAdapterHelpers.responseFromOpenAI has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (8 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"027539c94bdc3d7d8cff7b2e4d2be89a7f91bd826167dc2ab18afbbb9c6d71d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsoleEventObserver.Attractor.IEventObserver.OnEvent (cognitive 22): ConsoleEventObserver.Attractor.IEventObserver.OnEvent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (nesting depth added 10). 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/Attractor.Cli/Program.fs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed556d591078f3074ce8201e9b9d35bdbb86393c53f7083d92e497dfcaf6f83"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.diff (cognitive 22): Checkpoint.diff has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). 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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c611511febd55935eca9bc34cc146bc09d329edbd7660c69b2f317d3a0e129"}},{"ruleId":"D2","level":"warning","message":{"text":"Validation.hasUnguardedPathToCommit (cognitive 22): Validation.hasUnguardedPathToCommit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Validation.fs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf45660e2c3ed52d643e9e92b0ecef39777fd3e97bf4f6dca7fe0f39175c6dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.Grep (cognitive 22): LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.Grep has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CodingAgent/ExecutionEnvironment.fs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2e2d2a450dd819980b0d91edb48dcd408222c64d848aacc07ed3e6bb97347"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.ExecCommand (cognitive 21): LocalExecutionEnvironment.CodingAgent.IExecutionEnvironment.ExecCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 2 (5 pts), loops 2 (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/CodingAgent/ExecutionEnvironment.fs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6d451ec55b936e8941f3329e09c880427367c0d27cf9d758f1ba3dd39d24e"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.validate (cognitive 19): Program.validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4 (5 pts), boolean chains 1 (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/Attractor.Cli/Program.fs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28440e60c41db1d023a521735f2f96e1d2d91c367f01ad161f17c113a339569"}},{"ruleId":"D2","level":"warning","message":{"text":"Duration.TryParse (cognitive 17): Duration.TryParse has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 6, boolean chains 1 (nesting depth added 5). 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/Attractor/Types.fs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200d420fec1d1eb35806c37158d7102d260f330fb6e16559169d8612f067982"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheKeyModule.writeProviderOptions (cognitive 17): CacheKeyModule.writeProviderOptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (5 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). 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/UnifiedLlm/Caching.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f176afd9c283c95d96543a3448d1de26a3fb223d1801bec484c44b195a5fe5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.makeRegistry (cognitive 16): Program.makeRegistry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e710676bc1a8f781de5f55bd76cb1807a797683c9cc91da693dfe6d389600cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Validation.suggestAttribute (cognitive 16): Validation.suggestAttribute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Validation.fs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa3c9f28c478368b04e84b6c7975b075a41510ec391740f437547e1795cd1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectDocs.discover (cognitive 16): ProjectDocs.discover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 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/CodingAgent/SystemPrompt.fs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6a697843975c5e621b0a17fde5d07add0d4432ee32878ce22b816d8e9856fe"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSchemaValidation.validatePropertyTypes (cognitive 16): JsonSchemaValidation.validatePropertyTypes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 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/CodingAgent/ToolRegistry.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2af0a8692af4675e5c20157efb653a6ce51b0deca129f1b42ae863279bc1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: UnifiedLlm/HttpAdapters.fs: FileTooLong \u2014 2874 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 31 functions. The bar is 500 significant lines; this is 2374 over it, 5.75\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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"902a98059391cdf1f21155a356958cc048b387d55eb0e797511d151648080fc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Attractor/Engine.fs: FileTooLong \u2014 1426 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 926 over it, 2.85\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/Attractor/Engine.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04abfd3069903f4dc82fdbae8cbbdb0a93dab688016659658cb84bd444b8fc45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Attractor/Validation.fs: FileTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 852 over it, 2.70\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/Attractor/Validation.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c0f5bcdd1954c81bf5963f1b3117a8609ff33bea70bf9e4c5cbdacee428f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Attractor/Handlers.fs: FileTooLong \u2014 1242 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 742 over it, 2.48\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/Attractor/Handlers.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b6d9953d95d9eaaee180eb93327f6a895909bfd0fce59f98b505efb428b44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Attractor.Cli/Program.fs: FileTooLong \u2014 1179 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 679 over it, 2.36\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/Attractor.Cli/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5be43460b696dae19e88ae6de4fb52f07ae5c9f71678f1e7114b5eb02541bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodingAgent/Session.fs: FileTooLong \u2014 961 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 461 over it, 1.92\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/CodingAgent/Session.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75616bddbe830de6dbb1cabd851e8fb699fbf8fdb5e443554d7f01ddab7beb2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: UnifiedLlm/Caching.fs: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 319 over it, 1.64\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/UnifiedLlm/Caching.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30630cb85dcb5d631f19c127e70949f14b27475a730e9d3a41737da8ce36e060"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Attractor/Types.fs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50\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/Attractor/Types.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff00261943f318270da59f1d8502efe52a76c10b9e1726e9b36bb77ed1c2f95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AcpRuntime/Transport.fs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 240 over it, 1.48\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/AcpRuntime/Transport.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bef4884e0c3b8fda3863180b70d59d5f66d37f3030470fc47de0c0638dbea7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AcpRuntime/Client.fs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\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/AcpRuntime/Client.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79483d37e67044c3105fca4b827dc45c2dc6d128e39c38e07dfef94d6229b96c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: UnifiedLlm/ModelCatalogData.fs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\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/UnifiedLlm/ModelCatalogData.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf793ed76e57285e6474c1b611033123060160500f6a0dedfe592670d6e2de1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (392 shared lines): src/AcpRuntime/Transport.fs:1-929 | src/McpClient/Transport.fs:1-617 \u2014 These two members are variants of one another: 392 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"426fa4c49a203cbd30b936332e482583d082bbc038a800061fdf16beaf4ef902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77\u201378 lines \u00D7 2): src/AcpRuntime/Transport.fs:343-419 | src/McpClient/Transport.fs:195-272 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:343\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/AcpRuntime/Transport.fs:420\u0060 calls \u0060Cancel\u0060 and \u0060src/McpClient/Transport.fs:273\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5969eb1e253a50fc9dbbb6d119a90fdb86c51994bff8e5e04f9ea5e0752fc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2): src/AcpRuntime/Transport.fs:249-325 | src/McpClient/Transport.fs:100-176 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:249\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/AcpRuntime/Transport.fs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c53948ce6eeb25beb1ec8bd2095ce7ffa05b7e6cac092042847268582e923e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): src/Attractor/Engine.fs:543-597 | src/Attractor/Engine.fs:598-652 \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/Attractor/Engine.fs:543\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/Attractor/Engine.fs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf1b8c42d98f39aab772b5d36fe120e8f401313fa98447b4d18b4b8b72cf1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201349 lines \u00D7 2): src/Attractor.Cli/Checkpoint.fs:177-225 | src/Attractor.Cli/Checkpoint.fs:229-275 \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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5038dab594fd927a139dbb7ad149d4f2b74c4a5871ae0e7c28f11f2ce634faa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201348 lines \u00D7 2): src/AcpRuntime/Transport.fs:503-547 | src/McpClient/Transport.fs:343-390 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:503\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/AcpRuntime/Transport.fs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcbd0487916a66b511fca4f4503507dd5ba7f0373e0288ff9ddd85fb29f9d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): src/AcpRuntime/Transport.fs:569-606 | src/McpClient/Transport.fs:394-431 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:569\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9e8daaf17692f97bb6ea10e7fac5ab724e391ae51dd57cdf369cc4609d5a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): src/Attractor.Cli/Checkpoint.fs:97-128 | src/Attractor.Cli/Checkpoint.fs:131-161 \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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e067f137b1463b8869b1774f07b98f3b9e85e45ded350f323711faf8aa390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): src/AcpRuntime/Transport.fs:817-843 | src/McpClient/Transport.fs:519-543 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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/AcpRuntime/Transport.fs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"3897689ef711790c2a3e0bf1ac4ac55dc2324ec17b9017e6dcf50f21dba4bf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): src/AcpRuntime/Transport.fs:82-101 | src/McpClient/Transport.fs:63-88 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/McpClient/Transport.fs:60\u0060 calls \u0060stderrText\u0060, \u0060buffer\u0060, \u0060fun\u0060 and \u0060src/AcpRuntime/Transport.fs:80\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9bfa28813b730b146b93e0f41d25756dfbcae747808ddfcb2911c231649d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/AcpRuntime/Transport.fs:904-928 | src/McpClient/Transport.fs:593-616 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:904\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/AcpRuntime/Transport.fs:902\u0060 calls \u0060Cancel\u0060 and \u0060src/McpClient/Transport.fs:591\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4841e187ef1ab9ddca1f0d65cf010b38d564036e939de53e304c1f0b4e7b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Attractor/AcpHandlers.fs:49-73 | src/Attractor/Handlers.fs:123-147 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/AcpHandlers.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a1e4093f567f2a67c25c20c7b074ec990702eae03ec2dc77f6e6b259afa3cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): src/Attractor/AcpHandlers.fs:14-37 | src/Attractor/Handlers.fs:149-172 | src/Attractor/McpHandlers.fs:11-34 \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 all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Attractor/AcpHandlers.fs:12\u0060 calls \u0060JsonSerializerOptions\u0060 and \u0060src/Attractor/McpHandlers.fs:9\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/AcpHandlers.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8558cd9852a760069b3bd940bf79f1f485896a34d164036558fc131f45dce552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/Attractor/Engine.fs:1256-1279 | src/Attractor/Engine.fs:1557-1579 \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/Attractor/Engine.fs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16b12069a0ac31f9fff465b9166af662d36be19f9ed31b3bd2f5e33529d8d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Attractor/Engine.fs:1365-1388 | src/Attractor/Engine.fs:1778-1801 \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/Attractor/Engine.fs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ee1f5e4a60b89b9f80c34997a873f377643d7a5a46305a7007927e9ba0e26b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/Attractor/Engine.fs:1694-1715 | src/Attractor/Engine.fs:1746-1769 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Attractor/Engine.fs:1771\u0060 calls \u0060Fail\u0060 and \u0060src/Attractor/Engine.fs:1716\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"812d53b62b9b3a5df1d290561b0d5262d91000f57793a92bef65d382296edc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/AcpRuntime/Transport.fs:238-259 | src/McpClient/Transport.fs:89-110 | src/UnifiedLlm/HttpAdapters.fs:20-41 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeab6be87e7cb8c4010903dffb7d975cb979d5878e17bed4f8d7a0055b3dabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/AcpRuntime/Client.fs:390-409 | src/AcpRuntime/Client.fs:426-445 \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/AcpRuntime/Client.fs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e254d2e1090c1e5ea1a6fd01144a840e79a4274c35bc3ed14f52c586aa8069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): src/AcpRuntime/Transport.fs:794-810 | src/McpClient/Transport.fs:493-512 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:794\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/AcpRuntime/Transport.fs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c609b940c270308d2276aed7fdbea536f1634b6434de3fab94cb8ace011bc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/UnifiedLlm/Caching.fs:218-237 | src/UnifiedLlm/Caching.fs:387-406 \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/UnifiedLlm/Caching.fs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f880afbde492703498bc54e50d90157a62f0f1924fee83872dde12364a9557e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 3): src/Attractor/Engine.fs:943-961 | src/Attractor/Engine.fs:1207-1224 | src/Attractor/Engine.fs:1634-1649 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Attractor/Engine.fs:1207\u0060 calls \u0060Set\u0060 and \u0060src/Attractor/Engine.fs:943\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7e18943c745348cc648eae9610c17bff4cf86716732b7296c4283cac51724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/UnifiedLlm/Caching.fs:264-282 | src/UnifiedLlm/Caching.fs:428-446 \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/UnifiedLlm/Caching.fs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bb6d1a667456eaf394861c4cb19567ec2298366ed9a34709e27f15102baaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Attractor.Cli/Checkpoint.fs:411-428 | src/Attractor.Cli/Checkpoint.fs:445-462 \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/Attractor.Cli/Checkpoint.fs:411\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/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b007a1b982722a1f8853ee58ceaaa0fcf305273832197aad2e7ab7587e94096e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1621-1637 | src/UnifiedLlm/HttpAdapters.fs:3015-3031 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03bc4372eddb42a183d15da5c7837be00ffe53a29fa96b64cf3c02b05ad1f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/AcpRuntime/Transport.fs:65-80 | src/McpClient/Transport.fs:45-58 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/McpClient/Transport.fs:60\u0060 calls \u0060stderrText\u0060, \u0060buffer\u0060, \u0060fun\u0060 and \u0060src/AcpRuntime/Transport.fs:82\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d18f911aa884a04c4cabf8261231c280e61a637ca02661554b9d098d0992522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/AcpRuntime/Transport.fs:846-860 | src/McpClient/Transport.fs:547-562 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:846\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/AcpRuntime/Transport.fs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7659509fa6381f745db0bf0a1d840175bad6e7b0c16bfde161246fbd2f1921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/UnifiedLlm/Generation.fs:721-736 | src/UnifiedLlm/Generation.fs:1006-1020 \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/UnifiedLlm/Generation.fs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcda68e08c1dd74d1d433587ebcfbf2b0a6796a68109c832d2d7791df0881a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/CodingAgent/ProviderProfile.fs:241-254 | src/CodingAgent/ProviderProfile.fs:293-306 | src/CodingAgent/ProviderProfile.fs:347-360 \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":"src/CodingAgent/ProviderProfile.fs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ae8526944c54b24d6093c76731607b4e21f0fc1d672779244270d44122e1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Attractor/Engine.fs:868-881 | src/Attractor/Engine.fs:1072-1085 \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/Attractor/Engine.fs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"232b85088a9eb539d407a112c96c65e08bfc1ab93a8c4f0214c1e6006dd31ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Attractor/Handlers.fs:477-489 | src/Attractor/Handlers.fs:494-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/Attractor/Handlers.fs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"40516df07686a5dde8147929a5dcd615e2afa73c318a381ec4995063afc87608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/UnifiedLlm/Client.fs:133-146 | src/UnifiedLlm/Client.fs:159-172 \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/UnifiedLlm/Client.fs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5546e7fa5a931c6a012dee62cdba3f1a1d82771f4a34f71de42c753774247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/AcpRuntime/Transport.fs:754-766 | src/McpClient/Transport.fs:443-455 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1f4d12c841cf93f653d07202a7fc787d7df5af80b2c2f0dcae7fdad53fcdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/AcpRuntime/Client.fs:238-248 | src/JsonRpc/Correlator.fs:42-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Client.fs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e19de95ab534796cd14f71a0139354f02e9acaf059f9eb781abff63738bedd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/Attractor/Engine.fs:855-866 | src/Attractor/Engine.fs:1050-1059 \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/Attractor/Engine.fs:855\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Engine.fs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1673bb7008ba8a9577eab70660ad44dc46844914c5f702402e6458a7a95cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/Attractor/Engine.fs:1015-1026 | src/Attractor/Engine.fs:1726-1734 \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/Attractor/Engine.fs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b0df8f9865aedccf1cd94807ef12fc3a95988d9f6391a6652a58f0d0651d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Attractor/Engine.fs:1112-1123 | src/Attractor/Engine.fs:1614-1625 \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/Attractor/Engine.fs:1112\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/Attractor/Engine.fs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a88b8feb36958cb8bec0c8e4f2127dd087a10f3bc51e290a705562429ecc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/Attractor/Interviewer.fs:326-335 | src/Attractor/Interviewer.fs:347-358 \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/Attractor/Interviewer.fs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6cbb70a5b5496b8ccf36450e999513b7d7b62e609eba5f8e1bd34ca35a2591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/UnifiedLlm/Generation.fs:752-763 | src/UnifiedLlm/Generation.fs:927-938 \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/UnifiedLlm/Generation.fs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"762d96895f848e1854283a2ba567ed39b08a35ca9e6d392a06e2304a9137f560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:898-909 | src/UnifiedLlm/HttpAdapters.fs:1516-1527 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0291352b35b6db9dd113f536d68ca0b7fce99fd37e9c9d7953bb1f60fc3ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1202-1213 | src/UnifiedLlm/HttpAdapters.fs:1743-1751 \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/UnifiedLlm/HttpAdapters.fs:1202\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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b28b8f0293450e4dddeb6150efa4586d2a7ca5edb93820e4cf3712f9ff8efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1896-1907 | src/UnifiedLlm/HttpAdapters.fs:1915-1926 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592436d7c06b8bd672237a0f938280ecd0f69fcba26dae0f331ec959d54ea88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/AcpRuntime/Transport.fs:330-340 | src/McpClient/Transport.fs:181-191 \u2014 \u0060src/AcpRuntime/Transport.fs\u0060 and \u0060src/McpClient/Transport.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 417 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/AcpRuntime/Transport.fs:330\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/AcpRuntime/Transport.fs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf14d98f2c17c61d555d37a5d1c7fb034b3a6ec44ae5ab36d6ab32414c6ce7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/Attractor/Engine.fs:968-978 | src/Attractor/Engine.fs:1232-1241 \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/Attractor/Engine.fs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001168939e1cdc2645583a7f834bc3399ebd396aaf1f00eef96306e55694a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Attractor/Types.fs:277-287 | src/Attractor/Types.fs:416-426 \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/Attractor/Types.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7063e4d4caffb5416f79f10229540e43d4f95558c51fbaf4641d0a8aa9a36ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/CodingAgent/ProviderProfile.fs:275-285 | src/CodingAgent/ProviderProfile.fs:329-339 \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/CodingAgent/ProviderProfile.fs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef82af0f8ecc3d09936733cf645ecf22a6920483bcb4eac69561b4acb884e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/UnifiedLlm/Generation.fs:496-506 | src/UnifiedLlm/Generation.fs:824-834 \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/UnifiedLlm/Generation.fs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"944d6925c4a3cfd10afd52b7fec559191a5d4f0d6f6f9d7445f942983b13068f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/UnifiedLlm/HttpAdapters.fs:1207-1216 | src/UnifiedLlm/HttpAdapters.fs:1745-1754 | src/UnifiedLlm/HttpAdapters.fs:2608-2617 \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":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7df61a13837958d78f8d5cf5feeeea5dd0a94b45b3779f3343ea7bc4f4f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Attractor/Validation.fs:760-769 | src/Attractor/Validation.fs:777-786 \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/Attractor/Validation.fs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008a87c0edac50ac3588ac8beb16d319169d8d17c18e78ca26c89e4667a3f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:613-622 | src/UnifiedLlm/HttpAdapters.fs:760-769 \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/UnifiedLlm/HttpAdapters.fs:613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b8c9426ff26628d7d420bfc783dc4b96f0e2006d0e60f908bedba57a368d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1257-1266 | src/UnifiedLlm/HttpAdapters.fs:1422-1431 \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/UnifiedLlm/HttpAdapters.fs:1257\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0545fd7fc11953adcd590af9b3461912b1aaf88c155c42c4d557495e72b2c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/CodingAgent/ProviderProfile.fs:230-238 | src/CodingAgent/ProviderProfile.fs:282-290 | src/CodingAgent/ProviderProfile.fs:336-344 \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":"src/CodingAgent/ProviderProfile.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a032040f29c5f264c59626df850d180310996447c892da30b64123bbbb57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): src/UnifiedLlm/HttpAdapters.fs:1014-1028 | src/UnifiedLlm/HttpAdapters.fs:1624-1637 | src/UnifiedLlm/HttpAdapters.fs:3018-3031 \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":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cd1ece700e793de63268ab814ff19c737ac8acc00eeea13219f8ef296d7c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Attractor/Engine.fs:1298-1305 | src/Attractor/Engine.fs:1763-1770 \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/Attractor/Engine.fs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"38188d57ab6e6ff630fd4e07abeeabef661443509c84df63fdf2fb5829c122ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/UnifiedLlm/Caching.fs:74-81 | src/UnifiedLlm/Caching.fs:351-358 \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/UnifiedLlm/Caching.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27e44f46ba9e7cb67fa327169d9f70cc042f6580385cf84fe4096be9adf7b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/UnifiedLlm/Middleware.fs:82-89 | src/UnifiedLlm/Middleware.fs:106-113 \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/UnifiedLlm/Middleware.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"533fe43205e5b9f52108bfab752728cd55eac3c4e902071dccd85a19ef9bf109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/UnifiedLlm/Caching.fs:84-91 | src/UnifiedLlm/Caching.fs:356-363 \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/UnifiedLlm/Caching.fs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcf4f50c299d63d434d8bef3f39cb09c3cb97570dca7a29085bedc355bcee0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Attractor/Engine.fs:931-936 | src/Attractor/Engine.fs:1138-1142 \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/Attractor/Engine.fs:931\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. 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/Attractor/Engine.fs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd27ca9acbadc152cba410096cce0e94aa0177760dc395e20a2394c95a46cc8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Attractor/Engine.fs:962-969 | src/Attractor/Engine.fs:1650-1654 \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/Attractor/Engine.fs:962\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/Attractor/Engine.fs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b56ecd99ee33f8450cff1bd7e65b7faff7fb032c64745621dd344429f33dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Attractor/Handlers.fs:52-56 | src/CodingAgent/Session.fs:397-401 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Handlers.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f27f181a3a38d378d3ddfe125ffe189c76ae0b702fefa8b6df2a2cbb4df54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1178-1183 | src/UnifiedLlm/HttpAdapters.fs:1725-1729 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6bb479071a473d21d2afe65a766fd23f2c79d80770eae7d2445310ae66291d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:2298-2302 | src/UnifiedLlm/HttpAdapters.fs:2824-2828 \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/UnifiedLlm/HttpAdapters.fs:2298\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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"98075376c05623fbcbfe410c55fece53fd419af33968a53046967973aa845455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/UnifiedLlm/ProviderAdapter.fs:87-102 | src/UnifiedLlm/ProviderAdapter.fs:134-149 | src/UnifiedLlm/ProviderAdapter.fs:181-196 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/UnifiedLlm/ProviderAdapter.fs:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/ProviderAdapter.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6b9c192fb394ac5bee661232b99c33664cf0bcfbb84e71e492717b6dfe3ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:841-853 | src/UnifiedLlm/HttpAdapters.fs:2160-2172 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eaaefc455c09f039b29407721af3c8f2bc8abc257e843c3aacb7cf5680e8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/UnifiedLlm/HttpAdapters.fs:1621-1631 | src/UnifiedLlm/HttpAdapters.fs:2478-2488 | src/UnifiedLlm/HttpAdapters.fs:3015-3025 \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":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c85bc991de62e6dfa4cc58dea892abac2ca0b60b3c8a95c35f442f6e0344304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:2275-2285 | src/UnifiedLlm/HttpAdapters.fs:2806-2816 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/UnifiedLlm/HttpAdapters.fs:2273\u0060 calls \u0060Add\u0060 and \u0060src/UnifiedLlm/HttpAdapters.fs:2804\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a121da87f028532e29dda39caa1178264038ec54e38986f45925559a3599840c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/CodingAgent/Session.fs:250-260 | src/CodingAgent/Session.fs:262-272 \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/CodingAgent/Session.fs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c469cca7277b96eb4497d05a69ceaaa6e7c97f0f75969f79aaf06bcc44335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/CodingAgent/Session.fs:692-701 | src/CodingAgent/Session.fs:717-726 \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/CodingAgent/Session.fs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"122d426ae6212600a3f3e6bfc9492ca8e2c0c13f33baac7ebd61eb46925b00e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1278-1287 | src/UnifiedLlm/HttpAdapters.fs:1323-1332 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f170499bc1f485c2fd0fa42a0f9851367ed52dcbf146883bf58015310bafc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/UnifiedLlm/HttpAdapters.fs:1319-1326 | src/UnifiedLlm/HttpAdapters.fs:1359-1366 \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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824c25c9deb2d37bc459b00b8d211ad4a86374b13f66e4035723b5275a7583d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Attractor/Conditions.fs:59-66 | src/Attractor/Conditions.fs:68-75 \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/Attractor/Conditions.fs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98b4d414cdac6ac86af0857acf23cc54843d0a890521e4c3a85becda335ab01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Attractor/Handlers.fs:249-256 | src/Attractor/Handlers.fs:298-305 \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/Attractor/Handlers.fs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a661c871cbeed6c5bd67a1a4074bedf965189915baa5bd52d03b53ed63a3029b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/CodingAgent/Session.fs:160-165 | src/CodingAgent/Session.fs:169-174 | src/CodingAgent/Session.fs:178-183 \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":"src/CodingAgent/Session.fs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfbcf3b11a6283ae5f6222d05959a9127877124cb5d1ebf8793f304e4a66559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/UnifiedLlm/Caching.fs:500-505 | src/UnifiedLlm/Caching.fs:513-518 \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/UnifiedLlm/Caching.fs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7772708c8cfb168bab143edc80c5527906504714533433493c72bfd9e23a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/UnifiedLlm/ProviderAdapter.fs:79-83 | src/UnifiedLlm/ProviderAdapter.fs:126-130 | src/UnifiedLlm/ProviderAdapter.fs:173-177 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/UnifiedLlm/ProviderAdapter.fs:79\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/UnifiedLlm/ProviderAdapter.fs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6973c66e5a010767c0130c85159bf8c38518612de530f9e44b0fa2fa69e612"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/UnifiedLlm/Observability.fs: 0.0% line coverage (0/170)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/UnifiedLlm/Observability.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edef446a35d64fc9456ed4ba525b9d6d50aef8b935a70543568e638a303e772"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Attractor/Interviewer.fs: 35.6% line coverage (63/177)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Interviewer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a38cc8f5a29c0e02bf660983f31aa86b6b69998849054b5f785c9e1e2aa027a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Attractor/Library.fs: 33.3% line coverage (5/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor/Library.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b7f32ce35e0bc507fed58ecf6798510068143117814d1497fbfee39dfc0e79"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Attractor.Cli/Program.fs: 0.0% line coverage (0/1073)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff1262e5804fd56e86b69f27d51cd155f685d5fada536b51794442f22b31132"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/Attractor.Cli/Checkpoint.fs: 44.7% line coverage (135/302)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Attractor.Cli/Checkpoint.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510949bc6423ceb916322aaf64a96dd5256ae63ecf0c9640ecb93b1f8b55cfc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/AcpRuntime/Library.fs: 27.8% line coverage (5/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Library.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dd27124d4ba43c546d9bf74d33af1b4af4b0876fec3759e67540fc1de3f1a8"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: UnifiedLlm.Tests::UnifiedLlm.IntegrationTests.UnifiedLlm.IntegrationTests.circuit breaker middleware opens and later recovers after cooldown: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"733d23530af0c5bd4d0379dd1a087492f3214fd34af46b69941d30815a5b56c8"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated: coverlet.collector: coverlet.collector 6.0.4 \u2192 10.1.0 available (referenced by CodingAgent.Tests)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/AcpRuntime.Tests/AcpRuntime.Tests.fsproj"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c103dffb2991f00716d953af5858e6ea5076885723d50d7e31af02d4ed6fb960"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/CodingAgent.Tests/CodingAgent.Tests.fsproj"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15e61e4d7d074437bc1871b5b431f5258b931fea48ce490220c116ed89a3dd5"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/UnifiedLlm.Tests/UnifiedLlm.Tests.fsproj"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30f83e38fe152bc9157c8db136f4e4c2bf7361fa238529c66e34d006146d87e"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/AcpRuntime.Tests/AcpRuntime.Tests.fsproj"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a451031a424c436131bbf4378fe6c63d6ab22e34898860e9df448acbc161e"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Attractor.Tests/Attractor.Tests.fsproj"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8db9f39d772049c745daa55ec19a4c2a62a424e2b159466e834c7a12305da3a"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/JsonRpc.Tests/JsonRpc.Tests.fsproj"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f1f651c5ea44c9c647ec7c71fec1c3051035ad4c913aece04908340180b1e"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/McpClient.Tests/McpClient.Tests.fsproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b3e00d27323b61199f4e586b3e1007acd141f983b95ddf0d6e895b0673dfd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/UnifiedLlm/HttpAdapters.fs: src/UnifiedLlm/HttpAdapters.fs changed 5 times in last 90 days, max cyclomatic complexity 80 in OpenAIAdapter.UnifiedLlm.IProviderAdapter.Stream at line 1740. 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-06-14..2026-09-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-14 17:55:49 -07:00\u0027 --until=\u00272026-09-12 17:55:49 -07:00\u0027 --full-history --no-merges -- src/UnifiedLlm/HttpAdapters.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/UnifiedLlm/HttpAdapters.fs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"852e145fd0916379d9c75593c142eea0dc238249236bdd98d2a4ca1be4ddde77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Attractor.Cli/Program.fs: src/Attractor.Cli/Program.fs changed 7 times in last 90 days, max cyclomatic complexity 34 in Program.serve at line 1098. 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-06-14..2026-09-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-14 17:55:49 -07:00\u0027 --until=\u00272026-09-12 17:55:49 -07:00\u0027 --full-history --no-merges -- src/Attractor.Cli/Program.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/Attractor.Cli/Program.fs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd386e98c35e54638499d761e5189041fb1834fe60da9bb7f1ecc88ccb8226"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/UnifiedLlm/Validation.fs: src/UnifiedLlm/Validation.fs changed 3 times in last 90 days, max cyclomatic complexity 34 in RequestValidatorModule.fromCatalog at line 121. 1 of those changes was a fix/bug commit, and the other 2 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-06-14..2026-09-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-14 17:55:49 -07:00\u0027 --until=\u00272026-09-12 17:55:49 -07:00\u0027 --full-history --no-merges -- src/UnifiedLlm/Validation.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/UnifiedLlm/Validation.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3c10d776bc94da21d82178d9d78718c5586b2d9801ddf3f60417a1b7c0e5c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/UnifiedLlm/Caching.fs: src/UnifiedLlm/Caching.fs changed 3 times in last 90 days, max cyclomatic complexity 26 in CacheStoreModule.fileSystem at line 767. 1 of those changes was a fix/bug commit, and the other 2 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-06-14..2026-09-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-14 17:55:49 -07:00\u0027 --until=\u00272026-09-12 17:55:49 -07:00\u0027 --full-history --no-merges -- src/UnifiedLlm/Caching.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/UnifiedLlm/Caching.fs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f68100731c2f38c43e32398bf8c765d150e146b4ed2cebc750d11bcd3d2a46c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/McpClient/Transport.fs: src/McpClient/Transport.fs changed 3 times in last 90 days, max cyclomatic complexity 25 in Transport.createStdioTransport at line 279. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-06-14..2026-09-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-14 17:55:49 -07:00\u0027 --until=\u00272026-09-12 17:55:49 -07:00\u0027 --full-history --no-merges -- src/McpClient/Transport.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/McpClient/Transport.fs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"489f814518a5f2c6899c7fcac96664feaba6c32f4c054ad9218fe381fabceed6"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060external shim python snippet patches checkpoint fixture without corrupting JSON\u0060 spells \u0060JSON\u0060 where 29 names in the project spell it \u0060Json\u0060: 29 of 30 names in project analyzers spell the token \u0060Json\u0060 (29 of 30; unit: names in project analyzers containing \u0060Json\u0060). Peers: PromptMetadata.McpServersJson (src/AcpRuntime/Types.fs:89); Program.writeJson (src/Attractor.Cli/Program.fs:1079); AcpHandlers.parseArgsJson (src/Attractor/AcpHandlers.fs:92); AcpHandlers.resolveMcpServersJson (src/Attractor/AcpHandlers.fs:121); Engine.tryGetJsonString (src/Attractor/Engine.fs:687). Rename to \u0060external shim python snippet patches checkpoint fixture without corrupting Json\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/Attractor.Tests/Sprint014ValidationTests.fs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1984b346f80fbf5d8fda182190e92ea2202f588e0648d7a4b4870da93ef7c8e1"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060Events have correct session ID\u0060 spells \u0060ID\u0060 where 77 names in the project spell it \u0060Id\u0060: 77 of 79 names in project analyzers spell the token \u0060Id\u0060 (77 of 79; unit: names in project analyzers containing \u0060Id\u0060). Peers: ClientState.NextId (src/AcpRuntime/Client.fs:44); AcpClient.Prompt(sessionId) (src/AcpRuntime/Client.fs:53); AcpClient.Cancel(sessionId) (src/AcpRuntime/Client.fs:58); Client.serializePromptRequest(sessionId) (src/AcpRuntime/Client.fs:77); Client.serializeCancelRequest(sessionId) (src/AcpRuntime/Client.fs:97). Rename to \u0060Events have correct session Id\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/CodingAgent.Tests/Tests.fs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b518dfa20eec5a470bd93b7af4873ddc5f970049bc05fe02cda4df43ea07e5f"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060OpenAI continuation sends only tool outputs with previous response ID\u0060 spells \u0060ID\u0060 where 77 names in the project spell it \u0060Id\u0060: 77 of 79 names in project analyzers spell the token \u0060Id\u0060 (77 of 79; unit: names in project analyzers containing \u0060Id\u0060). Peers: ClientState.NextId (src/AcpRuntime/Client.fs:44); AcpClient.Prompt(sessionId) (src/AcpRuntime/Client.fs:53); AcpClient.Cancel(sessionId) (src/AcpRuntime/Client.fs:58); Client.serializePromptRequest(sessionId) (src/AcpRuntime/Client.fs:77); Client.serializeCancelRequest(sessionId) (src/AcpRuntime/Client.fs:97). Rename to \u0060OpenAI continuation sends only tool outputs with previous response Id\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/UnifiedLlm.Tests/CapabilityTests.fs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5008d43da0154e0b2cdb0483276cbd317705c4215bbb27c6d41b5045ade6556"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 8 project(s) overshoot their size bounds, lowering Project Cohesion to 8.3/10. The most over is \u0060src/UnifiedLlm\u0060 (7545 LoC, 139 module-visible types across 1 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"07007cb80d9b369e83bdf5bc81544d88996c86af318c20d4b8bf34eb30b65aca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"fdea6229d240da4504e0641956ab0df64cfeae5b9d170f75282343cfe7f36d64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"f88571ab6197e339fb1d31b8316bcc8a66be0a9c35d2976a5c1598c8fe5a8ed6"}},{"ruleId":"D31","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":"9514f2eda22790b5369860ff0772ac370eee8d645aeb5c5959402c01cf33ee94"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"f4c7a757741c127aa4b0095dcdcb3753562379a2e0bab432b9b26c99b5bf7369"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","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":"c1dfa61d52d1493b4fae31aa824ef6dfc4c88d99f7ed794bbe774275ac497712"},"taxa":[{"id":"CICD-SEC-5","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: 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 \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"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 2 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/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060src/JsonRpc/JsonRpc.fsproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/JsonRpc/JsonRpc.fsproj"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"399d1ba203fe6666fb47a64995277b0a130559bd56d93b1637465140447bbc03"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060completed || effectiveToken.IsCancellationRequested\u0060 appears character-identically in 2 files \u2014 src/AcpRuntime/Transport.fs, src/McpClient/Transport.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"984d6fe09f500c3276bfd0a8c95b3c1efa5917ac9d0b2c4800f1ee3db6f2c98c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keepReading \u0026\u0026 nextEvent.IsNone \u0026\u0026 not effectiveToken.IsCancellationRequested\u0060 appears character-identically in 2 files \u2014 src/AcpRuntime/Transport.fs, src/McpClient/Transport.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/Transport.fs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be5a518fd03077f89e09d07e006ca62807466429b3daaf8a9f8744ad89c74ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not (String.IsNullOrEmpty(dir)) \u0026\u0026 not (Directory.Exists(dir))\u0060 appears character-identically in 2 files \u2014 src/CodingAgent/ExecutionEnvironment.fs, src/CodingAgent/Session.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/CodingAgent/ExecutionEnvironment.fs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1763fb6a0869ffcbae060b3ff3951a270fd3bd8187ba627ed4d94e310f14ff8f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not (String.IsNullOrWhiteSpace(dir)) \u0026\u0026 not (Directory.Exists(dir))\u0060 appears character-identically in 3 files \u2014 src/AcpRuntime/DefaultDelegate.fs, src/CodingAgent/SessionPersistence.fs, src/UnifiedLlm/Observability.fs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/AcpRuntime/DefaultDelegate.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc49c10fedead0e3f900684d0856f21f1f32008e9d6650ba4b6ad215d09877"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"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":9,"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."]}]}