{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"id":"D42","name":"Runtime Threat Enforcement","shortDescription":{"text":"Runtime Threat Enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/D42"},{"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"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":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"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":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"Server.proxy (cyclomatic 268): Server.proxy has cyclomatic complexity 268 (threshold 15). Of this number, 266 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcc39cc8c6b751ccedb9f17e901e8711d77074ed0ae0888fb36253d7cd1fb64"}},{"ruleId":"D1","level":"warning","message":{"text":"install.uninstall (cyclomatic 172): install.uninstall has cyclomatic complexity 172 (threshold 15). Of this number, 162 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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":"installer/install.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"69676760e40544e5e698d596f5d767fdb3549541a41d24ad01fb29223cf46d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.spawnWrapped (cyclomatic 168): index.spawnWrapped has cyclomatic complexity 168 (threshold 15). Of this number, 163 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":6650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e207dd321c108df47526a3b5f637b3c51a02e2a9df1c422adf9c78974713eabc"}},{"ruleId":"D1","level":"warning","message":{"text":"index.restoreNativeOperation (cyclomatic 130): index.restoreNativeOperation has cyclomatic complexity 130 (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":"packages/cli/src/index.ts"},"region":{"startLine":11020}}}],"partialFingerprints":{"codehealthFindingId/v1":"2683bc43d75403c22f12fb97eeb9f5058038b45eb84f795fcc9e4b45484f5faf"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-leaves.selectLeaves (cyclomatic 100): provider-leaves.selectLeaves has cyclomatic complexity 100 (threshold 15). Most of this is not in the body itself: 12 of the 100 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 32, a function literal at line 54, a function literal at line 71, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e964d540ba098f3b60021e0d5222b2e1e894a44a02cc66847b0a693eedb446"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeIntegrationStatus (cyclomatic 97): index.nativeIntegrationStatus has cyclomatic complexity 97 (threshold 15). Of this number, 90 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":11588}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e157586e29e3cfae32f431cd8dc2c2c7d6258c91eb7063dd7013444aa475b2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeHook (cyclomatic 96): index.nativeHook has cyclomatic complexity 96 (threshold 15). Of this number, 94 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a778ed825f2042db8783d1a821a8f11f6d8959e1e102c360605e103c6a25160"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.onboard (cyclomatic 80): onboard.onboard has cyclomatic complexity 80 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. 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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b3dbfa0b5a0de212e0145f64057825290d7237eb9a08e32ab6d13d18b21e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.chatGPTAuto (cyclomatic 78): Server.chatGPTAuto has cyclomatic complexity 78 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02366f83bdda304196312f21384b6a088960ed4ff30ac7db9a8e797e6cf55de"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.BuildStatsReport (cyclomatic 76): Store.BuildStatsReport has cyclomatic complexity 76 (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":"proxy/internal/store/stats.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"548fa54750d67c89919c52d2a3f3f77c9ab28ee5f968be5a8bebc535a999aa64"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.checkPlan (cyclomatic 74): validate.checkPlan has cyclomatic complexity 74 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cde9bc08d3775c9742b582a98a25a52aa2afa8e38e417f828f4a79c64646ec"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validateReceiptContent (cyclomatic 73): index.validateReceiptContent has cyclomatic complexity 73 (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":"packages/cli/src/index.ts"},"region":{"startLine":22070}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518501b8c591f64aab163e83eed3d7f21cea478e99959c8e8382ba6ba4f6198"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.chatgpt (cyclomatic 69): Server.chatgpt has cyclomatic complexity 69 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea889c7057cd2a8d4fd331886de86b7dafaab5fbf238e409e1d9398aff896be"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenRouteOverride (cyclomatic 66): index.qwenRouteOverride has cyclomatic complexity 66 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16085}}}],"partialFingerprints":{"codehealthFindingId/v1":"adce5ff1122a4048e1d523fd61993a251bceffa4f2ba71e6102929f3a1d457e7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.status (cyclomatic 65): index.status has cyclomatic complexity 65 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":21760}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac2cf2db33edaed2e055e4dd4951f63f3a385cfe9252af3985df25aa74d36d"}},{"ruleId":"D1","level":"warning","message":{"text":"compile.validate (cyclomatic 64): compile.validate has cyclomatic complexity 64 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1652776d4daf35c45fb579a06be7b114fb0cc98243589624c913522d37aae5"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.optimize (cyclomatic 63): MiddlewareRuntime.optimize has cyclomatic complexity 63 (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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f4030628b8048a0b9b1240ac8ad4b98f4d4200414b2bd12a3771849a63919c"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.rewriteRequest (cyclomatic 62): Server.rewriteRequest has cyclomatic complexity 62 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e00276e1f9320e537ce6d9eedae0279be90a5317082a192abf23c565519fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-compat.compatForRoutedModel (cyclomatic 61): provider-compat.compatForRoutedModel has cyclomatic complexity 61 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4be33c147e089936dd175e00d28bc14f1f3fff4895ceafba47b7e73e32059"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.applyEffort (cyclomatic 59): Server.applyEffort has cyclomatic complexity 59 (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":"proxy/internal/gateway/route.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f80276aaefc44376bd93b77fabefcdca422be56ed59ee1ee69f47c01495d5"}},{"ruleId":"D1","level":"warning","message":{"text":"store.sanitizeRequestRecord (cyclomatic 56): store.sanitizeRequestRecord has cyclomatic complexity 56 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/store.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4666574364b4622500a1588eec1637f52fa9b16e94a6d18795e92017581f90"}},{"ruleId":"D1","level":"warning","message":{"text":"_native.leaves (cyclomatic 56): _native.leaves has cyclomatic complexity 56 (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":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"181eb2fc935228e9cdf51fe0ff4e3b66cea0fd86fe02b607c17328cd22773854"}},{"ruleId":"D1","level":"warning","message":{"text":"Reply.relay (cyclomatic 55): Reply.relay has cyclomatic complexity 55 (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":"proxy/internal/translate/translate.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52f01957252e873cd339c4c7d2ff60d7027549aa56b3ddf2290bbffcae2ee2c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeIntegrationStatus.files (cyclomatic 55): index.nativeIntegrationStatus.files has cyclomatic complexity 55 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8eb275a6fc47616681cf18efb48d45ea7ffe7eec2cedebbaab5b3f0255b19f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.readOwnedMcpPendingJournalAt (cyclomatic 54): index.readOwnedMcpPendingJournalAt has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16511}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f5affd6ece6f6045a4e7d51b356e78b829de00dd22da1d80021459f276da82"}},{"ruleId":"D1","level":"warning","message":{"text":"native-hook-fast.main (cyclomatic 54): native-hook-fast.main has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"477f2c060f9dcb131a28329d0ad9bf5160dffa1d2b03dac48cb9d6a3be31af1e"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.summarizeElided (cyclomatic 53): compressors.summarizeElided has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/invariants.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4444db9e33aff7c60963856a1a51b46bf8a275022ac83cb7362eca7ad1553c"}},{"ruleId":"D1","level":"warning","message":{"text":"install.main (cyclomatic 53): install.main has cyclomatic complexity 53 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"539d7aebfc255e160f72a1e3341c3e444d587683ae674e93b70dffb9fb62a800"}},{"ruleId":"D1","level":"warning","message":{"text":"index.login (cyclomatic 53): index.login has cyclomatic complexity 53 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ceb8dab5d47ac480da953edb017a4fd67bce6de45692553e1a513718ed11d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeDoctor (cyclomatic 52): index.nativeDoctor has cyclomatic complexity 52 (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":"packages/cli/src/index.ts"},"region":{"startLine":11867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b255532da0e410d16dc5648a1435c75c10d318128a57f1938327108c7295f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ai-sdk.project (cyclomatic 52): ai-sdk.project has cyclomatic complexity 52 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a3fed74ef95e9069a5d919a66298dc9106928208ef6b59fa920419c198eb46"}},{"ruleId":"D1","level":"warning","message":{"text":"index.buildWrapEnv (cyclomatic 51): index.buildWrapEnv has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f494baeecb0b33a28972e942e40328ba9db89bd10197879b8d1e92af8192cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderRouter.apply (cyclomatic 51): ProviderRouter.apply has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ef8f3a1bee57db49517ce0f38d23693112950eb28e0401dac9b534d8869fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.serveTarget (cyclomatic 50): Server.serveTarget has cyclomatic complexity 50 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/route_pool.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce28acc443d9b3c97ab19c723a0f43e9d1aa5e739730a5ad3739262236ac0dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.respond (cyclomatic 50): Runtime.respond has cyclomatic complexity 50 (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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"792de5d5fb538acffe82961836647cc276c16ba78d45685f15cfa1959673fc91"}},{"ruleId":"D1","level":"warning","message":{"text":"responsesToMessages.consume (cyclomatic 50): responsesToMessages.consume has cyclomatic complexity 50 (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":"proxy/internal/translate/messages_responses.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"443ceba4a47bbdfec3bddfc2a3645ce16b7a39964020bfcf46173420510ccb13"}},{"ruleId":"D1","level":"warning","message":{"text":"index.agentShortcut (cyclomatic 50): index.agentShortcut has cyclomatic complexity 50 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"69794c5d694438bca8669209e325d97d876763c3280dfda662c37c9527348817"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-activate.run (cyclomatic 50): caveman-activate.run has cyclomatic complexity 50 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 19 belong to 5 function items inside it that branch. 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/hooks/caveman-activate.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a3ba2ae5127b74eee2f9a831f426a92c36d91f37097b872d851e15b7db000b"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-mode-tracker.handle (cyclomatic 50): caveman-mode-tracker.handle has cyclomatic complexity 50 (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/hooks/caveman-mode-tracker.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae03a0d808a69f041eb293d1e2a24353743b95f6672697ed0e9bc22116f433a2"}},{"ruleId":"D1","level":"warning","message":{"text":"install.installOpencode (cyclomatic 49): install.installOpencode has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"301638687b817305c55e4774cf3a2e931da1295d2c34f3789bf99238c8a3f202"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.writeReceipt (cyclomatic 48): Runtime.writeReceipt has cyclomatic complexity 48 (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":"proxy/internal/nativeruntime/receipt.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"16833aabc62c2a5cd224252476bb1d811aceb0e076d6bb01b6d0087f59aa02b9"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.perMessage (cyclomatic 46): gateway.perMessage has cyclomatic complexity 46 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f4d32a827458b51cd9bc9ad2b1642fa02543bdc544060fcba2218e8fecc51"}},{"ruleId":"D1","level":"warning","message":{"text":"install.installHooks (cyclomatic 46): install.installHooks has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"42793ec9fd85326ec68edd837cfe5078e3df0257d01032340eedcb000c7dce47"}},{"ruleId":"D1","level":"warning","message":{"text":"index.setup (cyclomatic 46): index.setup has cyclomatic complexity 46 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 22 belong to 5 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"583e1088a49f3a9b00cea8f32c729d971b6c4d802c2399649516987fc8a381bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.validate (cyclomatic 45): Runtime.validate has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/validate.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9bb0806aebc9cbf66bc94f99bcd36cbd10b08ced1f2bbdacfc67ad9d2bf04"}},{"ruleId":"D1","level":"warning","message":{"text":"install.parseArgs (cyclomatic 45): install.parseArgs 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":"installer/install.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db544eba6d9a569d341b707b5c172dc6f651e1b84104e8c9c69090738497982"}},{"ruleId":"D1","level":"warning","message":{"text":"install.installClaude (cyclomatic 45): install.installClaude 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":"installer/install.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2de9a8f1002bff19e38b7c2c3a2cc560fcede00b10b7cc83e535e9c2865def"}},{"ruleId":"D1","level":"warning","message":{"text":"mastra.createProcessor.prepare (cyclomatic 45): mastra.createProcessor.prepare 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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda52c2d59eb7fa97ef943d8656cf1ef3a199625c536a97e40df226267b5d28"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.requestPricingUnsupportedReason (cyclomatic 44): providers.requestPricingUnsupportedReason has cyclomatic complexity 44 (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":"proxy/providers/adapter.go"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed13631b117e1e4bcbcaf863105f07f36c0891c59df4c37fd59f0610316c68d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.learn (cyclomatic 44): index.learn has cyclomatic complexity 44 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":20889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20c59d2a6a27cba0b795ce3be65fb7493e4a530f27a9fe78623ec3d3944e48b"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-parse.parseModeChange (cyclomatic 44): caveman-parse.parseModeChange has cyclomatic complexity 44 (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/hooks/caveman-parse.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b249c5d83c26e95e19694b61620a8aeeedf4536d6a34f0ff520eece54afb84ea"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.chatResponsesBody (cyclomatic 43): translate.chatResponsesBody has cyclomatic complexity 43 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 17 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a5410d700bfd92de6c09386f90531e2f8a8c322498ab84c21fd4ecb6378336"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.planModules (cyclomatic 43): apply.planModules has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdb631df1f36b104666762b5d4699023577021f7beaef84dbd52ebcf877c15b"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.applyModules (cyclomatic 43): apply.applyModules has cyclomatic complexity 43 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"02446bb32893afe37c1e089b22b9fac5d1f5f1c2005547e2f0033fa7cc9b3943"}},{"ruleId":"D1","level":"warning","message":{"text":"evals.validateJSONSchema (cyclomatic 42): evals.validateJSONSchema has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/evals/graders.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"790238e56cfb20ef606e53ae45b356a9b58cf051753ba2ff451a23f0747f8e83"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runServe (cyclomatic 42): main.runServe has cyclomatic complexity 42 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a56019a5a5b7b56b3f58da8e860f2afcfc827285d75339f64d3f7bd950b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.syncAutoEntries (cyclomatic 42): index.syncAutoEntries has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 3 of the 42 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4358, 4361). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd20d4658c512a571e8f1364563077deb0193b64f6f159a4dd4f59fd4b432c0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.enableNative (cyclomatic 42): index.enableNative has cyclomatic complexity 42 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 18 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"00de8fa0872104e06de538e8649d2eae192c2f64d528c5b3bef0acb50a29847d"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.createCavemanFetch.cavemanFetch (cyclomatic 42): transport.createCavemanFetch.cavemanFetch has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c590094b5b94d4a03e402b27c2becd57ad3d39b80a213119d648ccc014275b"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.toRow (cyclomatic 42): ingest.toRow has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/ingest.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"de95dc682489053ea4ead02678db1b78f70557e1513764aa6d2cc8393d2719e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.toRow (cyclomatic 42): ingest.toRow has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee08a700e6cf345e53d440e08957128b2ff2cd9a1530feed8e5800fd67b91b"}},{"ruleId":"D1","level":"warning","message":{"text":"Link.ask (cyclomatic 41): Link.ask has cyclomatic complexity 41 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fd562437d076de0fee31ed0a4499f2d8ab431346bda4007bcd0be4bb8e213f"}},{"ruleId":"D1","level":"warning","message":{"text":"Cave.assemble (cyclomatic 41): Cave.assemble has cyclomatic complexity 41 (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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dac8164856702db9b75f160d7a1029f9529d945cb6ade6d57f9fd56653ba81"}},{"ruleId":"D1","level":"warning","message":{"text":"index.formatSessionSavings (cyclomatic 41): index.formatSessionSavings has cyclomatic complexity 41 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043604914966012746f0059214635c0abadd8581762ec39ee4bea4d6dc86ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.assemble (cyclomatic 41): index.assemble has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1512cada87979728213e9091046586db87198fe5fa8eaddf90563a7695b894"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.ServeHTTP (cyclomatic 40): Runtime.ServeHTTP has cyclomatic complexity 40 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"proxy/internal/middleware/http.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1feda52c97f682ea43621983f8ed6fc5dfc907bb4df310b5ca4b357e32357a"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.mergeSnakeUsage (cyclomatic 40): providers.mergeSnakeUsage has cyclomatic complexity 40 (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":"proxy/providers/adapter.go"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eb2328a08c5073d83bffb907b3067048f37c5177001e6cc245f0f68ba4626f"}},{"ruleId":"D1","level":"warning","message":{"text":"mastra.createProcessor (cyclomatic 40): mastra.createProcessor has cyclomatic complexity 40 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. 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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"553dc8de9a6f387bdfd5f24b8e08eb6ee58b43f33b36d67b424380c9d8361275"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.streamChatToResponses (cyclomatic 39): translate.streamChatToResponses has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95a6817fdb146dd24f01c8469d732f190fe0966849f25dcecee60dcde9794f3"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanASGIMiddleware.__call__ (cyclomatic 39): CavemanASGIMiddleware.__call__ 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":"packages/middleware/python/caveman_middleware/asgi.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7efa36de81b0e4939f156032d80dd8d6340aaee623eb354954fcf871c2acab3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.claudeProfileMutations (cyclomatic 39): index.claudeProfileMutations 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":"packages/cli/src/index.ts"},"region":{"startLine":8930}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1740ae72000b9aea45d9ee527cee71658aea11c0c28cff92926cc7bfbe6e94f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.kiloRouteOverride (cyclomatic 39): index.kiloRouteOverride 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":"packages/cli/src/index.ts"},"region":{"startLine":15858}}}],"partialFingerprints":{"codehealthFindingId/v1":"488a08db5a8bef03d6f28088f91f9bc3fe7e9860b2a29c5e358f3068cedb5bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"measureHarness (cyclomatic 39): measureHarness has cyclomatic complexity 39 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 12 function items inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8278cb216b732cbb11f049dd685537f9d28cd5558fbfbf9c7a2aafed49690c"}},{"ruleId":"D1","level":"warning","message":{"text":"evals.Grade (cyclomatic 38): evals.Grade 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":"engine/evals/graders.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02675863493e6b1c4c2c1f3d54240484c7c82e1f2b7b6ce27eb7d7a22ebdba"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.record (cyclomatic 38): Server.record has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d94b25ac8bbdce022b892ed0f9f2c65d864cb019c94414e0f223f3a85ae19d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.retrieve (cyclomatic 38): Runtime.retrieve has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"proxy/internal/middleware/recovery.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2605a21dbfdde8594530970a07931fc47086ee73c0c5bc53dacc120752a2de85"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.streamResponsesToChat (cyclomatic 38): translate.streamResponsesToChat 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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc74c67b64d47f49c10843060035eeb82edef207d6964c4d31e90d3cf462e28"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.streamAnthropicToResponses (cyclomatic 38): translate.streamAnthropicToResponses 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":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee712f09f1b9f18fdeae1c865fbaa7146245f316032ed74d7b0ef51920036bb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.cleanClaudeProfile (cyclomatic 38): index.cleanClaudeProfile has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee4ef826cb0b1aaba59b933884733013a8e58e5e4c417685d5ad481a2a2f476"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.focusAXRecords (cyclomatic 37): compressors.focusAXRecords 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":"engine/compressors/axtree.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e952b1fc09dbb33af0b41005d94430f9a8bb9dbdfdd820a13bea8d063e63b460"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.publish (cyclomatic 37): Runtime.publish 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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"79deb88e6a903fef3b3a70c09376e6418f6eae15e2f6d7497df1ec41c1a1f027"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.streamAnthropicToChat (cyclomatic 37): translate.streamAnthropicToChat 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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"028024e52b270e85b0c1f803ec2431d2e65cee0499af0114e6ca122794853259"}},{"ruleId":"D1","level":"warning","message":{"text":"Link.decide (cyclomatic 36): Link.decide has cyclomatic complexity 36 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"709df6c75f757317cbae53d24c04be07f4e91e82d096441a1821ec2527b1fbc1"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.chatMessagesBody (cyclomatic 36): translate.chatMessagesBody has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"68805c35889eb032aa17582d5b3481b78db8e6dd61ef49815ffcc0433526d634"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.appendChatMessage (cyclomatic 36): translate.appendChatMessage has cyclomatic complexity 36 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 20 belong to 2 function literals inside it that branch. 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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd3755dff130fd6ae318219b8397f65642efe4660b44a77dca06ea03a057f71"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.modulesDoctor (cyclomatic 36): doctor.modulesDoctor has cyclomatic complexity 36 (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":"packages/cli/src/modules/doctor.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3ad63d819a50ab682a139eab1098e8ca7dfc6d027df37cc87fd14221a5da22"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.newRouteRun (cyclomatic 35): gateway.newRouteRun has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"proxy/internal/gateway/route.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc114b45360d8d7e2c42b97ac3dbe6bcca487ffadc724ed7aaae99bacb67c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"store.scanConfirmedFixMetrics (cyclomatic 35): store.scanConfirmedFixMetrics has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 15 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 331, 320). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"68415bba152db9ffea29444acffb12e7d715cb3d03cf3578a94f74003b3c4b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionEventConsumer.consume (cyclomatic 35): sessionEventConsumer.consume has cyclomatic complexity 35 (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":"proxy/internal/store/session_source.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0184bef6941b8760ff9fa89958474a4b76b0504e0e3bc6747190f55df7c0b94f"}},{"ruleId":"D1","level":"warning","message":{"text":"install.installGemini (cyclomatic 35): install.installGemini has cyclomatic complexity 35 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"80109936d8f22ad8780741fe7ec10daa6685e1a8a7782c637a456e2225271c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.#optimize (cyclomatic 35): MiddlewareRuntime.#optimize has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdb9d5159102f782600fecf8575ab205a68f97a9bb5ffc3e81983722ec78fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.sniffLanguage (cyclomatic 34): compressors.sniffLanguage has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_cgo.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4dbe1cedcabcb49eb7cfe25b210150f4a688efb73cee2fac464d0a2e47b4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"middleware.New (cyclomatic 34): middleware.New has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f8255b5ad9cde1a0613e36801ab18d6c76a810eb71e9c1917bcaf6e3926dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.report (cyclomatic 34): MiddlewareRuntime.report has cyclomatic complexity 34 (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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caa0e0919f654a9620ad4bb34f379386468f1f362f5b77732e016057898a13d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.buildOpenClawOverlay (cyclomatic 34): index.buildOpenClawOverlay has cyclomatic complexity 34 (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":"packages/cli/src/index.ts"},"region":{"startLine":12111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c2d4823b79222170d9ab487c10f699cc9e82fe1d907538f166dd7cf2da549"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonCompressor.selectArray (cyclomatic 33): jsonCompressor.selectArray has cyclomatic complexity 33 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. 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":"engine/compressors/json.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257a66a6ea53deab0d8321acdbc87aac63a383f141830693cc93ea5157c28b7"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runLearn (cyclomatic 33): main.runLearn has cyclomatic complexity 33 (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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc9e155f2de41ed106a548a3352cd2376e04943e29dc2fae70f01d6417828d7"}},{"ruleId":"D1","level":"warning","message":{"text":"store.simulateLearnPlan (cyclomatic 33): store.simulateLearnPlan has cyclomatic complexity 33 (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":"proxy/internal/store/learn_simulate.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fa47fdef81cca9442a20f3716468b409bfa0eefe62fa796a1b39017eabbb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.parseUsageBytes (cyclomatic 33): providers.parseUsageBytes has cyclomatic complexity 33 (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":"proxy/providers/adapter.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb410cf3dd3952b4169b8ede0b7a8c16b751d85a413a2917f93c740fbed3a66"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.responsesZones (cyclomatic 33): openai.responsesZones has cyclomatic complexity 33 (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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"da985b3c8d5e2c61a9f2b58a7f53482a868308397c086f99e0666f0e7ea39238"}},{"ruleId":"D1","level":"warning","message":{"text":"index.opencodeNativeMutations (cyclomatic 33): index.opencodeNativeMutations has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9763}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97824e1db7d049ef9adafb16054e73f0559aa8244895218887b5b402b20474f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenControlSurfaceOverride (cyclomatic 33): index.qwenControlSurfaceOverride has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16021}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0ff55260f0ec96dd607365ea48c1785212bae51efb8920a366dc3a701ad22"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runCavemanDeviceFlow (cyclomatic 33): index.runCavemanDeviceFlow has cyclomatic complexity 33 (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":"packages/device-auth/src/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81e79dfb7bcb3772516e4f199ad531f7618d6b971c6e5699b004e6966da9136"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.validate (cyclomatic 33): validate.validate has cyclomatic complexity 33 (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":"packages/shared/contracts/scripts/validate.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5d425a2a0f54822e2facf2263757c6b85f23aa18eddfaf9ceb10ecbc83c42c"}},{"ruleId":"D1","level":"warning","message":{"text":"prefixMonitor.observe (cyclomatic 32): prefixMonitor.observe has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a0117900928b6cabbbd82baa6cb842139a863d766899884545cc62e8e15c1"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.responsesChatBody (cyclomatic 32): translate.responsesChatBody has cyclomatic complexity 32 (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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed10b7bb37962a8fe21d62ef80e49825f5b20be043e9aed57146fc420c498540"}},{"ruleId":"D1","level":"warning","message":{"text":"google._prepare (cyclomatic 32): google._prepare has cyclomatic complexity 32 (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":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9645baaf1e9ca4bcce87b0bc511fc1491aa330f4a78b900a32ec891d791d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.localScanUploadFromRetro (cyclomatic 32): index.localScanUploadFromRetro has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13137}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e5be24a9eef3fbac15fec307c1490e48b3a02588f056f42fea999d4056d00c"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.acceptsRecovery (cyclomatic 32): transport.acceptsRecovery has cyclomatic complexity 32 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed721576545be97888353a88842da91cd06ea1deb1cc58ca3c8af08ddc696ad"}},{"ruleId":"D1","level":"warning","message":{"text":"google.project (cyclomatic 32): google.project has cyclomatic complexity 32 (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":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a448920c022f611d7b52ca86a64065e8564942fb06aace9728b4553c82c7e88"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.constructor (cyclomatic 32): MiddlewareRuntime.constructor has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de859764b8d583b44854b491aa708d4e9eb5d8d3bd64b2d9dfd1679e822290"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.stripRetrieveCall (cyclomatic 31): gateway.stripRetrieveCall 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d758d2f567be00b4f589f9c8f47f848186ac1f55eee083caa3ccae6455c0521"}},{"ruleId":"D1","level":"warning","message":{"text":"Creds.Resolve (cyclomatic 31): Creds.Resolve 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":"proxy/internal/standalone/standalone.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1e8ef69ad773919dddf2d8255d00aec8b4d23594be6d79c196c77afc7582a4"}},{"ruleId":"D1","level":"warning","message":{"text":"store.sanitizeStatsMeasurement (cyclomatic 31): store.sanitizeStatsMeasurement 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":"proxy/internal/store/stats.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e0f4b9627cd4fa25dfd90f1af14a58ec28c09a06df72aff9b4d621bb185aa"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanModel._project (cyclomatic 31): CavemanModel._project 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":"packages/middleware/python/caveman_middleware/strands.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8de1fbbd5541070f5978a869d30ecb0e8a3ebc9317036cbf82e715f45f92b2"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-mcp.validateTraceFilters (cyclomatic 31): agent-mcp.validateTraceFilters has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f50f7bfe058d444799343ae0aaa4c81df4e240b889355ee934c1e914488b82"}},{"ruleId":"D1","level":"warning","message":{"text":"index.mcpInstall (cyclomatic 31): index.mcpInstall has cyclomatic complexity 31 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16780}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a980c12b4a9d07d5e31871594ddaaf99704cc88598b2ecbb5249ebe466c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.default (cyclomatic 31): index.default has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 178, a function literal at line 234, a function literal at line 269, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acc2947d1e376ed671269266d9722356166ee4b7da7593f5818427edbcf1c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.contextPack (cyclomatic 31): index.contextPack has cyclomatic complexity 31 (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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9406ef1d426f3cf8513a1f013d9969736c058ada41d2a3127ea0aaf6d07944"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.recordChatGPT (cyclomatic 30): Server.recordChatGPT has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e978622e609dbc937869da17cc973a6e2d2a02c05f86076a685389baaa72f7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.buildLearnPlan (cyclomatic 30): Store.buildLearnPlan has cyclomatic complexity 30 (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":"proxy/internal/store/learn.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"18247c4b0ee80108006ca4da231f39852d15fb5ee6baa2e3450d18ec2d6bfc88"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.pruneOrphanedManagedHooks (cyclomatic 30): settings.pruneOrphanedManagedHooks has cyclomatic complexity 30 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. 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":"installer/lib/settings.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"120b6b26746da140d4e785563c0b95b88ec962db3ed735a9318bb24647da099f"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.toggle (cyclomatic 30): onboard.toggle has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 8 function items inside it that branch (render, a function literal at line 725, a function literal at line 695, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4796ffd17b7b48c11988c9a8820c026d34dc05b76953acca1eb255a6555c882"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-config.safeWriteFlag (cyclomatic 30): caveman-config.safeWriteFlag has cyclomatic complexity 30 (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/hooks/caveman-config.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e748ec55c13b9989997b191dd9dc3141fa2820535eeffff39e1d94e8c4b2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"tabularCompressor.compress (cyclomatic 29): tabularCompressor.compress has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/tabular.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142c17f80854f03227c36fe456e242d79f91827d930b6edf54a6ff56f15af5e"}},{"ruleId":"D1","level":"warning","message":{"text":"store.scanLearnSessionMetricsUntil (cyclomatic 29): store.scanLearnSessionMetricsUntil has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 161, 153). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"866f680314fae4d7d20125cdc43e56dc66008b9a8ed1057ffe2724e9a305c430"}},{"ruleId":"D1","level":"warning","message":{"text":"compress._compress_file_locked (cyclomatic 29): compress._compress_file_locked has cyclomatic complexity 29 (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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7582a9c41413a5bf66f9efcc1e888b0a930a8f5a4d494da6974cf119c67b5826"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_catalog.validate_row (cyclomatic 29): validate_catalog.validate_row has cyclomatic complexity 29 (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":"shared/provider-catalog/validate_catalog.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c729dd2dca1a358a822e3a103a7db253c22d08d095ba45ae753a9618a815c6"}},{"ruleId":"D1","level":"warning","message":{"text":"compress._compress_file_locked (cyclomatic 29): compress._compress_file_locked has cyclomatic complexity 29 (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":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce7c472d025f9c50a826248522cfb647641c1074e3767faf4b7d920b7519781"}},{"ruleId":"D1","level":"warning","message":{"text":"owned-install.installOwned (cyclomatic 29): owned-install.installOwned has cyclomatic complexity 29 (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":"installer/lib/owned-install.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e240f88fad2b1cee99d6f9b50b21110af89c3cf595310fb58cedc7bbc7937135"}},{"ruleId":"D1","level":"warning","message":{"text":"learn-autopilot.runAutopilot (cyclomatic 29): learn-autopilot.runAutopilot has cyclomatic complexity 29 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. 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":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd86a524572bb1dd448a4c40924bafaf25eb5359b52492175d4d5c36a9962e9"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.choose (cyclomatic 29): onboard.choose has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 803, render, gaveWay, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f116f8871270a2762d6b96010dc7ab6ec9360b9ca69a8345b61810043451f4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.managedHookIdentity (cyclomatic 29): index.managedHookIdentity has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8058}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8be1f4d8479233450afdf1532bf664bc58e63f0934b736858971aeabbbc0ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hooksCmd (cyclomatic 29): index.hooksCmd has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba8a018558cf8ff64aaed97715d8e5bbf9f4703e6bec4b994b32da3bbfb35df"}},{"ruleId":"D1","level":"warning","message":{"text":"index.mem (cyclomatic 29): index.mem has cyclomatic complexity 29 (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":"packages/cli/src/index.ts"},"region":{"startLine":21064}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8916caddcb5a1ebc8bf946c00065758a790f21eff5e92bc3a4d194217e3c78a"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanMCPHost.project (cyclomatic 29): CavemanMCPHost.project has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mcp.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b480e6bbc375c5d6f97a4a0fc700c4ceea756a9754cf3c9140e58af90849ede"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.parseCapabilities (cyclomatic 29): validate.parseCapabilities has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afd1978164afd859d71c23142549a19cc8cb9e0523487927c27fd5912c29435"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 29): main has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 5 function literals inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d2928cb088d3799a8a8bc410f3c627962d0bcb96d65e3e5d7b69dd54899ed"}},{"ruleId":"D1","level":"warning","message":{"text":"oidcVerifier.verify (cyclomatic 28): oidcVerifier.verify has cyclomatic complexity 28 (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":"proxy/internal/identity/oidc.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ebaaa50fce987bafe0327d1f9ae982f32c9ae939e2acee6e0c1099e6f6847"}},{"ruleId":"D1","level":"warning","message":{"text":"store.retroStreamCutTokens (cyclomatic 28): store.retroStreamCutTokens has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8a4f8e80038ec6dc7853b2c42dc906b2e4a5a9f23e9fd77f05004187331481"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.replayCompressionMove (cyclomatic 28): Store.replayCompressionMove has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5c697ce2372a04bb5ff492984037460dadaa55c304bb3e969f1f898426b7fc"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicyClient._decide (cyclomatic 28): RuntimePolicyClient._decide has cyclomatic complexity 28 (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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"89398550a2f764ab0ec7afea9ae0ada6d4fa847ed6516358d9f1970b8494400b"}},{"ruleId":"D1","level":"warning","message":{"text":"openclaw-provider-compat.preserveOpenClawProviderCompat (cyclomatic 28): openclaw-provider-compat.preserveOpenClawProviderCompat has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/openclaw-provider-compat.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34dd2f7b0489c46c43130ebd0b63d45ff7e30d5d3d6fcd7e86631d35720aaaf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.withMcpConfigLock (cyclomatic 28): index.withMcpConfigLock has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c202076e1d683d34b8cbc632d5acc3b3d7bb8592add7336c310430055b965c3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.syncLocalSavings (cyclomatic 28): index.syncLocalSavings has cyclomatic complexity 28 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 12 belong to 6 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":13525}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaad23085506e8354b292f3a1f5cc90d9e5fc93f49227d6f3a49b7444aa41088"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hermesRestoreOwnedByValue (cyclomatic 28): index.hermesRestoreOwnedByValue has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ead0cefadf7f777c31a0f086d3f2bee09dac80aef4c6cafdf6a7fc2420512"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runPixelRender (cyclomatic 27): main.runPixelRender 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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c9edfdbac5e7c19617a8f7932db55fd7b5f1c0d6ab3f7eca3a2e885ece830"}},{"ruleId":"D1","level":"warning","message":{"text":"store.AttachLearnTrendHistory (cyclomatic 27): store.AttachLearnTrendHistory 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":"proxy/internal/store/learn_trends.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc5266102a43e7abfa7762a98f5028ccf18f6b9883e2c95d762308e86b372a"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.__init__ (cyclomatic 27): MiddlewareRuntime.__init__ has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf783c2c9294f21c11435d4d87acd86c9308208be918532066e8726f0a791b"}},{"ruleId":"D1","level":"warning","message":{"text":"release-smoke.main (cyclomatic 27): release-smoke.main has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".blocks/release-smoke.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a296ed2877e46644100a715658ba8bfcdd8eb8c2be85ee94924eb832df69c22e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.transactOwnedMcpConfig (cyclomatic 27): index.transactOwnedMcpConfig 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":"packages/cli/src/index.ts"},"region":{"startLine":16661}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cafa21d53fab0517a253afeb774ae133532bdb3133b0d429beefbd7860980d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hermesFlowSequenceItems (cyclomatic 27): index.hermesFlowSequenceItems 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":"packages/cli/src/index.ts"},"region":{"startLine":19026}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ddeb0a6a9b7fdcc4d3cbb6e1bfadebeb2b093ae6d712d54e43ea5d5c6d42a6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.renderLearnPlan (cyclomatic 27): index.renderLearnPlan 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":"packages/cli/src/index.ts"},"region":{"startLine":20291}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ccd10ba2cbc8343b443c005b12a69f8a20c3702923b78f353089e6181995f9"}},{"ruleId":"D1","level":"warning","message":{"text":"langchain-model.prepareLangChain (cyclomatic 27): langchain-model.prepareLangChain has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 67, 72, 80, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdf48f375cfc3d8e93c9348ce56a1b6fa68cdb555dab65d1d85dfb255790807"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.validatePage (cyclomatic 27): validate.validatePage has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bb90ef2a9bd58180027a1ebd9fdf9919d28640fa98d28cc832a24df1a76869"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.openWithBudgetHooks (cyclomatic 26): ccr.openWithBudgetHooks has cyclomatic complexity 26 (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":"engine/ccr/store_sqlite.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"64058ea646b51e07eeaec6d22b15e94cd7e69b4e61633329deedd24736a40cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.observeCachedPrefix (cyclomatic 26): Server.observeCachedPrefix has cyclomatic complexity 26 (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":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa520e3f568adf9a9e3cae59a59ef226280aa15f5434d61d6af8d2a257f27df"}},{"ruleId":"D1","level":"warning","message":{"text":"store.retroSessionPathsUntil (cyclomatic 26): store.retroSessionPathsUntil has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 571, 594, 564, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"802cea35859be7279f70989a0815ac93ec8f42b712848b61b42768c9b0f11ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"requestScan.str (cyclomatic 26): requestScan.str has cyclomatic complexity 26 (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":"proxy/providers/inspect.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a77c9bf2080ce8dfdcf52c557bb0127aaa2c498704a5af09b9afb4a1aeb42"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanLLM._options (cyclomatic 26): CavemanLLM._options has cyclomatic complexity 26 (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":"packages/middleware/python/caveman_middleware/crewai.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc56404cdb0849af0afc59261e5c452d106e205141c0895359a68a33e001e38"}},{"ruleId":"D1","level":"warning","message":{"text":"owned-install.uninstallOwned (cyclomatic 26): owned-install.uninstallOwned has cyclomatic complexity 26 (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":"installer/lib/owned-install.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcad8b83c821638398a034c23f5460ac00cee0942a2ca4f3d83befdd7684a84"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-mcp.validateTraceSearch (cyclomatic 26): agent-mcp.validateTraceSearch has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8556b8855e210ab560d93614b525d3131d111c533133dbf6b3a61d92d9a89f8"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.inactiveReason (cyclomatic 26): apply.inactiveReason has cyclomatic complexity 26 (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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e23612535511a14bfeb07a60317c744fbdd3aae257c2bdc4d6143838014110"}},{"ruleId":"D1","level":"warning","message":{"text":"index.engineSessionTelemetryFields (cyclomatic 26): index.engineSessionTelemetryFields has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b6084b2fd6e46800c5eb75e9be7345cb059d0d3a4702bfe6fb6346e55f057"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.project (cyclomatic 26): transport.project has cyclomatic complexity 26 (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":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c195a8173318dcb09a6fa016168fee196319048c65f7b017ee15cacb6458301e"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.wrapOpenAI (cyclomatic 26): openai.wrapOpenAI has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 82, 109, 87, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/openai.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"923afffb13af4571217b6c2cf3ccba85472dd25a116d267e65e57cd01eb0fdcc"}},{"ruleId":"D1","level":"warning","message":{"text":"verbs-gate.loadSurfaces (cyclomatic 26): verbs-gate.loadSurfaces has cyclomatic complexity 26 (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":"skills/verbs-gate.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"469134a484a0e6a9f571a8070dcfd719acd60474cdde957e218f1857125b78a6"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.statsPricingOriginKnown (cyclomatic 25): gateway.statsPricingOriginKnown has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"041b8496b896086d43da179e945ebc9bd456e29ee94303026e2a4f04fd096f36"}},{"ruleId":"D1","level":"warning","message":{"text":"store.mergeBehaviorScan (cyclomatic 25): store.mergeBehaviorScan 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":"proxy/internal/store/learn.go"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d8a8010d760aa1a902eb39d836fda2a0a9a7933517a0122d58249d31cd5ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.messagesToResponses (cyclomatic 25): translate.messagesToResponses has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 719). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"326c1a866cc674db9f5f1281326b5c4355822ca8dbbb8d27b6ecdc335eeadd74"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.Request (cyclomatic 25): translate.Request has cyclomatic complexity 25 (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":"proxy/internal/translate/translate.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d7d0165bd02e6e4ba99ec5cdd7787cc306bad9e885470389fbcf533cd897d"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanChatCompletionClient._project (cyclomatic 25): CavemanChatCompletionClient._project 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":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a522ee0522eebc3229459c3579164250d1d0ef75d10a84670e615a720011bcdb"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot_contract.validate_snapshot (cyclomatic 25): snapshot_contract.validate_snapshot 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":"evals/snapshot_contract.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9042c2a74383401dab1784512ff3f83f74b1fe4f075bff4ef2435374da6953c"}},{"ruleId":"D1","level":"warning","message":{"text":"compress.mask_code_blocks (cyclomatic 25): compress.mask_code_blocks 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb71434018a80c05555229c752a6a61a811ad46c1586e30c42052293faae7c"}},{"ruleId":"D1","level":"warning","message":{"text":"compress.mask_code_blocks (cyclomatic 25): compress.mask_code_blocks 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":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad817a89ba89a99d15707b64ee5b73fa623312191f192ffbef68df775d80a8b"}},{"ruleId":"D1","level":"warning","message":{"text":"compile.collectInjectionModelIds (cyclomatic 25): compile.collectInjectionModelIds has cyclomatic complexity 25 (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":"agents/compile.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d570b5fe6a33e8ea3d62abf285203bb1ba5baa399815c623f3a0ebb20a79790"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-routing.verifiedProviderRoute (cyclomatic 25): provider-routing.verifiedProviderRoute 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":"packages/cli/src/provider-routing.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d7251b708153d8248cde53216dce4849c1b56c1131c438f423b4543ec92c50"}},{"ruleId":"D1","level":"warning","message":{"text":"index.yamlScalarAfterKey (cyclomatic 25): index.yamlScalarAfterKey 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":"packages/cli/src/index.ts"},"region":{"startLine":14357}}}],"partialFingerprints":{"codehealthFindingId/v1":"066b0be7f1b0b05936422eb53c980af2029402f079a54caea71ff40503497944"}},{"ruleId":"D1","level":"warning","message":{"text":"index.usage (cyclomatic 25): index.usage 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":"packages/cli/src/index.ts"},"region":{"startLine":21176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4f603723c8e8eb9b4f7bb98d6ecffd34a59e52467176d6340e048251d123d1"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.wrapAnthropic (cyclomatic 25): anthropic.wrapAnthropic has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 47, 53, 70, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/anthropic.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d96d9a8de55a79e505b61e29e94f5a00941b2ac4e60c327961f09d12df2767"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.#exchange (cyclomatic 25): MiddlewareRuntime.#exchange has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b707f03a4c81f18e3a868e9de4f40f8f64f38ac777494632bf63fea91fb94da6"}},{"ruleId":"D1","level":"warning","message":{"text":"verbs-gate.scanSkillBody (cyclomatic 25): verbs-gate.scanSkillBody 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":"skills/verbs-gate.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"683fd47c6fb9ff6e8acf8f0a6de4a7c968514e6dcc16549e50a35093d1de7131"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-stats.attributeByMode (cyclomatic 25): caveman-stats.attributeByMode has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"28778e40d045f0fe5bd9eada32d84477252ba81ad05f31a4286b4a7072036fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"cloudlink.askTextFor (cyclomatic 24): cloudlink.askTextFor has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcdb7b544812696098822a74ed13a165336d511e19b0d08763a615bce7089ec"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.parseRetrieveCall (cyclomatic 24): gateway.parseRetrieveCall 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"391b9a91a2de321ef9eeab393362d7825738e66454932526b0904e5801217257"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.Identify (cyclomatic 24): Resolver.Identify 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":"proxy/internal/identity/identity.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d7047f024807b7471ac4ff028eccf54e1905c0dfb13e7cf51f5d074cab8bee"}},{"ruleId":"D1","level":"warning","message":{"text":"oidcVerifier.fetch (cyclomatic 24): oidcVerifier.fetch 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":"proxy/internal/identity/oidc.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1c966f780c4ae912bac47b558b3bc10f95110734895f5513f467ce774d9e7"}},{"ruleId":"D1","level":"warning","message":{"text":"nativepack.validate (cyclomatic 24): nativepack.validate has cyclomatic complexity 24 (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":"proxy/internal/nativepack/pack.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078dfebe8e2379fa4dac78dcadd1c81f6afacfd1921b2ec65f4784ea4c123d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.ensureTaskContract (cyclomatic 24): Runtime.ensureTaskContract 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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf5209936ef986f8a7254af992c08e823a7003b6325e346a06347bbc021567"}},{"ruleId":"D1","level":"warning","message":{"text":"store.outcomeSink (cyclomatic 24): store.outcomeSink has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_outcomes.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cb9630335d7c6015349c7cff5d25943e11b8b40fe30d69ec1e3a9c78a10879"}},{"ruleId":"D1","level":"warning","message":{"text":"store.buildLearnTrends (cyclomatic 24): store.buildLearnTrends 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":"proxy/internal/store/learn_trends.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6689c58168778fb17043f7c20d330126bf72e0d0819482918cbb82703b1384c0"}},{"ruleId":"D1","level":"warning","message":{"text":"opencodeSessionSource.scanSession (cyclomatic 24): opencodeSessionSource.scanSession 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":"proxy/internal/store/source_opencode.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"be68b1d3d256786eeeec103a93032f437a7a4019a90a372ee830f759ecd8fe9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.BuildTrialPlan (cyclomatic 24): Store.BuildTrialPlan has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/trial_store.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfff7830d0a40b9bcf0443ffe07142e301e50a2a1dc5ccbc0f94625124e57cc"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.valueEnd (cyclomatic 24): translate.valueEnd has cyclomatic complexity 24 (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":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b137d77d3bc68db6605559c0a5ce614095de958024a3f424da2e7d1fba344eda"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.messagesChatBody (cyclomatic 24): translate.messagesChatBody has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e05fc06d2eae878efe3764a48cb25506fa1be716ee7d40a357a362447d951"}},{"ruleId":"D1","level":"warning","message":{"text":"Reply.serve (cyclomatic 24): Reply.serve has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7044fd7f11a0db1c69b45d823c4f4536a474dc0df26e4a572de4d31568535d4"}},{"ruleId":"D1","level":"warning","message":{"text":"catalog.DecodeAndValidate (cyclomatic 24): catalog.DecodeAndValidate 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":"shared/platform/catalog/catalog.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce7b00e62cae8acb0a83745524e48448f666d22f3cbab006aa938970d631ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanLLM._options (cyclomatic 24): CavemanLLM._options 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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3263661589950c2ad6123e2f7c053eb18954052691764d21175bf3f6a745e3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"_ContextPacking.pack (cyclomatic 24): _ContextPacking.pack 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f4e497de0a6874de1054b9a4580127fa177f2024b8d3b8a1d95e3fd74ee40d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicyClient._accept (cyclomatic 24): RuntimePolicyClient._accept 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd0a7d9d5407b1370916c8366c8be2adae62905c74028215851982cac1cde72"}},{"ruleId":"D1","level":"warning","message":{"text":"index.enableProfiles (cyclomatic 24): index.enableProfiles has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 10847, 10848). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10840}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc2af6c8c248ce8885278584a82f6c97a4a0db4f4ecf3ff9f54da33666b7ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.RepairStore (cyclomatic 23): ccr.RepairStore has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"engine/ccr/store_repair.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60621d3d5903d009d671be85a68ebf4ecc851245c21957d7ae15a24c8fa57fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.consolidateRepositoryMaps (cyclomatic 23): Store.consolidateRepositoryMaps 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":"engine/ccr/store_reclaim.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3f4fdd58458d35f35070cde199d0ee9fed06246a1f96d24b4f0fb3d1d50fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.parseConfig (cyclomatic 23): compressors.parseConfig 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":"engine/compressors/config.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cea42c50007080e9c2a736e8e518519abadb4b9eb8cc9fa8f1dde4633e0901"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.parsePytestJSON (cyclomatic 23): compressors.parsePytestJSON 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":"engine/compressors/testreport.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6047efde17c490b90e8e857804452534727663501b80e30daf78447f3cf32866"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.withDefaults (cyclomatic 23): Config.withDefaults 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":"proxy/internal/config/config.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f04159c54e129b6c4df589f5cfbfbc2412152a1b74eecadc854973fb7effea"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.requestAccounting (cyclomatic 23): gateway.requestAccounting 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":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"43703d4a991e87d90bcba041004e92698b1760f712f2198dff727a0989aeb34a"}},{"ruleId":"D1","level":"warning","message":{"text":"middleware.previousPlan (cyclomatic 23): middleware.previousPlan 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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"994f9ca1f34afb1239bee7821ac29b2fd3e66f113078581fb5121615db8d7582"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeruntime.classifyTool (cyclomatic 23): nativeruntime.classifyTool has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b27074087b3fd15c58270e91a8c722a49a3c444a63c09f968eef6c202dafef7"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.LoginChatGPT (cyclomatic 23): Store.LoginChatGPT has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"proxy/internal/pool/chatgpt.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ecfac6742450c14b741a07f97e5e1da73e709816b90b40b0125781f42bb13"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.saveIf (cyclomatic 23): Store.saveIf 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":"proxy/internal/pool/pool.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de7c3d013c6c6abf093afae7cb60b826da87d6e9a39337c0e6839caa4bc047"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.mergeGeminiUsage (cyclomatic 23): providers.mergeGeminiUsage has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"df711c3b20409b7b3f57cb6d36894eb8a63aa728a47355ccceba0b11f9e7d64b"}},{"ruleId":"D1","level":"warning","message":{"text":"_native.accepts_recovery (cyclomatic 23): _native.accepts_recovery has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a3c1b2921d40e841ff67a32eeed065bd1b3aced67a2e275c65c0138c63af62"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanModel._project (cyclomatic 23): CavemanModel._project 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":"packages/middleware/python/caveman_middleware/pydantic_ai.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"345655770ff9ffc2ea658fe57015ff917ce6ad22bda1e3e1863f7ebf4b3964cb"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.resolve_proxy (cyclomatic 23): protocol.resolve_proxy 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":"packages/sdk/python/caveman_cloud/middleware/protocol.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29a6f34137dd94871f651f9e887cae2a47897e4008088160bd5ff0cecac6ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.plan (cyclomatic 23): validate.plan 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":"packages/sdk/python/caveman_cloud/middleware/validate.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6c1a7467c5867e4e9e43f5eafb8790eb029b7872df380fe3c358654aaf52ec"}},{"ruleId":"D1","level":"warning","message":{"text":"stats-cli.parseStatsOptions (cyclomatic 23): stats-cli.parseStatsOptions 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":"packages/cli/src/stats-cli.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6728f214efd11e42be194bff0746b835bc3d906a807a3c3d62d3a2d478725e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hookCommandTokens (cyclomatic 23): index.hookCommandTokens 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":"packages/cli/src/index.ts"},"region":{"startLine":7996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3103140415f7878db0d8f38f5e6b0246a233be14893b138f3dca6911339814b2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeHooksDocument (cyclomatic 23): index.nativeHooksDocument 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":"packages/cli/src/index.ts"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c92a7eb3d8e0bdf27adbe37a979273b53d197bec2c80c22dc653785b14b2d0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.emitShrunk (cyclomatic 23): index.emitShrunk 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":"packages/cli/src/index.ts"},"region":{"startLine":17273}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b31ed1955a03d12bfa870c7c7a064581f159cff60db7decb14d82baf466214"}},{"ruleId":"D1","level":"warning","message":{"text":"mastra.withCavemanMastra (cyclomatic 23): mastra.withCavemanMastra has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 118, protection, a function literal at line 108, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665ae878f85004a588e64a2c0c0996391fa75d59563d7f381740363f09f9b53"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanStrandsModel.project (cyclomatic 23): CavemanStrandsModel.project has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"packages/middleware/typescript/src/strands.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2374879426987155a03822e14ad46a24d926af58c7d04eb52cc28991eb72813"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicyClient.evaluate (cyclomatic 23): RuntimePolicyClient.evaluate has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"337fa70b222fe9e11c288467f5485b6505a499be9665dec06eb7cb8bf233d50a"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-stats.formatStats (cyclomatic 23): caveman-stats.formatStats 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/hooks/caveman-stats.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"180995c4153fb68db11054780e456c835ee8b5ea4cc7c3c393fed7b5758d1ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.expireBatch (cyclomatic 22): Store.expireBatch has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_reclaim.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f69de80a9b0cc86092efd12b24ee39112aafb637974fafdab581198cd71da3"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runPixelSimulate (cyclomatic 22): main.runPixelSimulate 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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a375d7aede08b2da9ecb785682fc2125e5828ed9a4f2c30b2075136a8cd6c25"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.curateAXTree (cyclomatic 22): compressors.curateAXTree has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e112d6415c7f8b3b1249c45bcb165efe5503339c8e3751c31d61089266082"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.readJSONTOONValue (cyclomatic 22): compressors.readJSONTOONValue 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":"engine/compressors/toon_encode.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"920b7088570d163bb6158c245ebc934b58fa89a971d91a1828fa4740f0de83ef"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.fallbackKey (cyclomatic 22): gateway.fallbackKey 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":"proxy/internal/gateway/auth_fallback.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"664a1794235b515b8618cce6c5367a9775d740fc3cf72df18ce8debed518038b"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.compiledPlanRoutes (cyclomatic 22): gateway.compiledPlanRoutes 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2cf3aaf1c37ad67344d9de760d0254943e11f2355de0fb0edd63b0ec665f86"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.stripToolSchema (cyclomatic 22): Server.stripToolSchema 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":"proxy/internal/gateway/toolschema_strip.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20bab19e32f405cb60a25f1d235c088cf9a9f3552e42589fb07368d97b4894b"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.receipt (cyclomatic 22): Runtime.receipt has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/recovery.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db502c07fc484c60f3c5fc78e73892186ec88a332139844c7c456cc867bdb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"store.collectInstructionFiles (cyclomatic 22): store.collectInstructionFiles has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"225dbe16b457b7844181d3b26ab31e57c57c268124ec06bfd178d7b210620164"}},{"ruleId":"D1","level":"warning","message":{"text":"store.comparableConfigTokens (cyclomatic 22): store.comparableConfigTokens 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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"24294e4cb3e8793d252840fa559941762b344dbc5eb8301bd68a7c1e2322015e"}},{"ruleId":"D1","level":"warning","message":{"text":"postgresMiddlewareTx.ExpireBatch (cyclomatic 22): postgresMiddlewareTx.ExpireBatch 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":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4decec0aefed900f90b509fa4728d3681705208ac8fc88f6330e435ab3df841"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.buildLearnRetro (cyclomatic 22): Store.buildLearnRetro has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"80971b346001394a43d00cf5fef2c6d1d29f2057e09253c8f1ce90f3fbcbe76d"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.strictNode (cyclomatic 22): translate.strictNode 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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"42372b71434bd8837ca9a11f0edff84784e6743b4d2979156a6c221a127d516a"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.sseLines (cyclomatic 22): translate.sseLines has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 101, 78, 143). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7011d982584894a4bea44021df1f40e3b3953e05c2bc772a0cfbd18e21cb984c"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.SanitizeAndMapHeaders (cyclomatic 22): Adapter.SanitizeAndMapHeaders has cyclomatic complexity 22 (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":"proxy/providers/bedrock/signing.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d9e9f1ab7a2200e9788f22a2ebbaa99264eced1421efdb79cbb84b022f2a99"}},{"ruleId":"D1","level":"warning","message":{"text":"version.cmpVersion (cyclomatic 22): version.cmpVersion has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/version.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f7f303563cf5a6b23859160d7a1ca107dbfb766b7699d22b10e6172f21d7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"openclaw.installOpenclaw (cyclomatic 22): openclaw.installOpenclaw 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":"installer/lib/openclaw.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aad41161a5d9f43df6eda41703b435d10061cc0df06dffa24fa19577736fbc4"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.moduleSwitchCommand (cyclomatic 22): apply.moduleSwitchCommand has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81e93f476c2214a8e0c51c609ab2809143bdd2beff6cb4e9df81e1fe554787e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.resolveInvocation (cyclomatic 22): index.resolveInvocation has cyclomatic complexity 22 (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":"packages/cli/src/index.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d42389ffe897e709b83a2a72fb54af821ec7f14ecbfe99fe5c6a4f037dffc4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.yamlScopedBaseUrl (cyclomatic 22): index.yamlScopedBaseUrl 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":"packages/cli/src/index.ts"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10ada0262e46e37e5537361ee27d2b58203bf7492400ade123cd7450241ae34"}},{"ruleId":"D1","level":"warning","message":{"text":"google.delegatedClient (cyclomatic 22): google.delegatedClient has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 165, 175, 181, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"563dad832a7751cf49007ce8cfd9bd023d86d56d3b64d93932cad4701b0d9e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.toolSearch (cyclomatic 22): index.toolSearch has cyclomatic complexity 22 (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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5662bd5a041c157c45b0a64aedfe05120e2b9c9ba506f24cd50a71420cad401b"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.resolveProxy (cyclomatic 22): protocol.resolveProxy 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":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d46f9d96862675a265d074303051bb63334a5f010caed5ea45dc992fada6740"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-stats.parseSession (cyclomatic 22): caveman-stats.parseSession 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/hooks/caveman-stats.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0779683b394a13dc371b443022d493f8d2efd7865e6bc7ee8c01995a161be1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"CDPDriver.waitActionable (cyclomatic 21): CDPDriver.waitActionable 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":"browse/cdp.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa58e37aa4d06eb2c6115a732d1129d091ac786ed04d9ea7ff12f79ecdee75d"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.inspectFigures (cyclomatic 21): ccr.inspectFigures 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":"engine/ccr/store_repair.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"52abc34bd44230a46c8221254675ad6ee1500437591cb4b3f517073ffd9a8402"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.putObjectOnce (cyclomatic 21): Store.putObjectOnce 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":"engine/ccr/store_sqlite.go"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"e171e55f7381d70d35d2bbe67e68b9786e762034dc6d9cb0191629f9992c835b"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.parseTOONObject (cyclomatic 21): compressors.parseTOONObject 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":"engine/compressors/toon_decode.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"146fbb6b6642acfba980c9409f166a56e917889b5de22fa606ff6f555aa5ddfa"}},{"ruleId":"D1","level":"warning","message":{"text":"configCompressor.compress (cyclomatic 21): configCompressor.compress has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"engine/compressors/config.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e3e6dcea5508a70cdbd370495255bbc277a9b3ced21c15521f7ab99faa2b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"contextwindow.Pack (cyclomatic 21): contextwindow.Pack has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/contextwindow/contextwindow.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8e334a179af7f9ac0dfa8791544f64bd3f96f184962f95ab2bd1291ec646f3"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.collectOpenAIChatPixelLiveZone (cyclomatic 21): gateway.collectOpenAIChatPixelLiveZone 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad7ecde19267313e1480c6eaf20ab08a2ec44baf89a31ccd2325fece8e9d648"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.collectOpenAIResponsesPixelLiveZone (cyclomatic 21): gateway.collectOpenAIResponsesPixelLiveZone 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"834155602d03b0997d97f981a58a21a7be91426c33fc36c48e6327eba884fc7e"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.containsNonTextInput (cyclomatic 21): gateway.containsNonTextInput 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":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32a99fb504b7214cdd034b1d72d9568dd8ef5ca25166d65610694243c384ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.runRetrieveLoop (cyclomatic 21): Server.runRetrieveLoop 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"67573eabaa42336c88c267dfbc9e9b2f8ff43d6351bee62590bd92d46a1b18b9"}},{"ruleId":"D1","level":"warning","message":{"text":"repointel.buildBundle (cyclomatic 21): repointel.buildBundle has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"proxy/internal/repointel/index.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba7d04b1e84863e01671f05c517d2c57e8ec771db48d1d18e2a7610355b195"}},{"ruleId":"D1","level":"warning","message":{"text":"store.trendSparkSVG (cyclomatic 21): store.trendSparkSVG has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_trends.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07557a39f39e951577cb4661bc29ebf38f4639c033ded88bd11667f74eaf832"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.messagesFinish (cyclomatic 21): translate.messagesFinish has cyclomatic complexity 21 (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":"proxy/internal/translate/msgbuild.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa39130c485beddca74b90387ec08e116ca462dc1cdbf9bcdaa65f76bcfb1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.ResolveUpstreamURL (cyclomatic 21): Adapter.ResolveUpstreamURL 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":"proxy/providers/bedrock/routing.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"635ade6f24633613e9ee34d4384be6a0bddf6ec259b7643cb6cf8ee08276d4be"}},{"ruleId":"D1","level":"warning","message":{"text":"requestScan.number (cyclomatic 21): requestScan.number has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/inspect.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bac7dc6a1e56a1c48010c4d67e47827f51304aa3a832f71c911782162d818e"}},{"ruleId":"D1","level":"warning","message":{"text":"OTelExporter.record_span (cyclomatic 21): OTelExporter.record_span has cyclomatic complexity 21 (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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"265a58c3b5b6e41be4b4d0f196721858a6eef440aaf8362990553349b32531b6"}},{"ruleId":"D1","level":"warning","message":{"text":"owned-install.loadJournal (cyclomatic 21): owned-install.loadJournal has cyclomatic complexity 21 (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":"installer/lib/owned-install.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970cc3a6b1132c91e9726359b0e08dfd71cb8d29b08408075707a8b3cf8cc22"}},{"ruleId":"D1","level":"warning","message":{"text":"openclaw.uninstallOpenclaw (cyclomatic 21): openclaw.uninstallOpenclaw 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":"installer/lib/openclaw.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2bf4bd4ae948bc6e91115d7ab25975e371588640d80b71e251d5f786fd1949"}},{"ruleId":"D1","level":"warning","message":{"text":"install.inspectOmpRegistration (cyclomatic 21): install.inspectOmpRegistration has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"669f3d7a9804b65035c1c2232a57c822975af373ef7657741de8d66db08493e9"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.signInStep (cyclomatic 21): onboard.signInStep has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. 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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"89957e24aebda900ce270bafda53dbe0495ac0efcfa21c1557b2ad65f6fb9754"}},{"ruleId":"D1","level":"warning","message":{"text":"index.stripJson5Comments (cyclomatic 21): index.stripJson5Comments 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":"packages/cli/src/index.ts"},"region":{"startLine":7342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fc85c79f6ad258da37f5b8cd761c43c78c2b1403cfe969f520e2017b577b03"}},{"ruleId":"D1","level":"warning","message":{"text":"index.codexHooksTrusted (cyclomatic 21): index.codexHooksTrusted has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10072}}}],"partialFingerprints":{"codehealthFindingId/v1":"c812d99d768faa9d7e525786f8ade64eb364ef49e8b2c0110dade52fbc8acabe"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hermesNativeConfig (cyclomatic 21): index.hermesNativeConfig 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":"packages/cli/src/index.ts"},"region":{"startLine":10374}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb395e5333ac29b8b54c7fa14f6ced47b1693d7e8630fe495821967be000db8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.recoverOwnedMcpTransaction (cyclomatic 21): index.recoverOwnedMcpTransaction has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":16602}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d90dda4f0e9e3fb847ee8007bb0f4e583afcf003e7193113a6d98a4037ccb0"}},{"ruleId":"D1","level":"warning","message":{"text":"tool-output.shrinkToolResult (cyclomatic 21): tool-output.shrinkToolResult has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"packages/pi-extension/src/tool-output.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"82418a33d611dfc14b6fe8a90eea8ac529cbceae70d8e71eae37b7559a6fc19b"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicyClient.refresh (cyclomatic 21): RuntimePolicyClient.refresh has cyclomatic complexity 21 (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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d27674f8e03471a0a72bfd5ceb3622d0df8ffab16bc0dc854ce53a8074af8a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.guardPasses (cyclomatic 21): index.guardPasses 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b322ff0724b61b2fc581e4ec4fb35940b70bca946cfc760852849e8f16195e"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.prepareObject (cyclomatic 20): ccr.prepareObject has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7f5d1f84457deccea935d237cd7f593828a82875283ffc5db7baff489a61c"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.parseTOONArray (cyclomatic 20): compressors.parseTOONArray has cyclomatic complexity 20 (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":"engine/compressors/toon_decode.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5af4bcdbafd3c6b819cedbd186302fee1099b416e7d11357389424cb117597"}},{"ruleId":"D1","level":"warning","message":{"text":"logCompressor.compress (cyclomatic 20): logCompressor.compress has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/log.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f361ca485ea8797080fe768ca5ae55f30b7ad4d7aa216c385eb62ce09a41f90a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.Detect (cyclomatic 20): Engine.Detect has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/detect.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d058f1c70d2ddbea779ef811fcf4d6aa843edcfde9d7ee44c6f2be3286e087"}},{"ruleId":"D1","level":"warning","message":{"text":"image.anthropicVersion (cyclomatic 20): image.anthropicVersion has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/tokens.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64899c9e5315a478b0a55871c59c589741ba9b913311bda81ab378be4ba048"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.Recall (cyclomatic 20): Store.Recall has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"mem/store.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5707df99dae59bc20a09c67b7bc263bbcded43a63e9a4550a2ec376db5230fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"middleware.caseFolded (cyclomatic 20): middleware.caseFolded has cyclomatic complexity 20 (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":"proxy/internal/middleware/presence.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f04a0f99695f034e4fc774d62f876db98d78b24827e0553140944d86398bab"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeruntime.StripSessionMarkers (cyclomatic 20): nativeruntime.StripSessionMarkers has cyclomatic complexity 20 (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":"proxy/internal/nativeruntime/marker.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edb0c724e87de862c1a6e7696ef757987df9452f136a755f8a541068c7b9506"}},{"ruleId":"D1","level":"warning","message":{"text":"store.measureAppliedFix (cyclomatic 20): store.measureAppliedFix has cyclomatic complexity 20 (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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d6f7537f675e913d358474ff985c45dfa2c3ef2b5820191c4f50166c405eab"}},{"ruleId":"D1","level":"warning","message":{"text":"store.buildLearnPortfolio (cyclomatic 20): store.buildLearnPortfolio has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b8d1a9e04b7a25151c14a4b4eef3cabbe777cadd1903bcb3392a1e514ab936"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.treeAt (cyclomatic 20): translate.treeAt has cyclomatic complexity 20 (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":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b62ad17bfbc77d1bd2ac4808b6ab843ca173994458391d35b781d65358fe52"}},{"ruleId":"D1","level":"warning","message":{"text":"Base.SanitizeAndMapHeaders (cyclomatic 20): Base.SanitizeAndMapHeaders has cyclomatic complexity 20 (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":"proxy/providers/adapter.go"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"95260b753165d55b9a13f1bf7fdedaf177a7a076791d4acf05838a4fa8236de9"}},{"ruleId":"D1","level":"warning","message":{"text":"bedrock.matchesInboundSigningIdentity (cyclomatic 20): bedrock.matchesInboundSigningIdentity has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/signing.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49360d5b5501d5bfb840ca62dcc4470d1483b8ce3b33aa59425d58ca9dd20b"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.ApplyProviderNativeTransforms (cyclomatic 20): Adapter.ApplyProviderNativeTransforms has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/cache_key.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c26401e4746370913220e39cae567fa05935f06c590d969b86c533971926d"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.with_caveman_openai_tools (cyclomatic 20): openai.with_caveman_openai_tools has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/openai.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7960bf3406c6dcfa29e24a4d8799a95b6b88e844865999214faf816737466d5"}},{"ruleId":"D1","level":"warning","message":{"text":"llm_run.main (cyclomatic 20): llm_run.main has cyclomatic complexity 20 (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":"evals/llm_run.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c82668c82042d50218768dcf8c6c9bda68899187b1eb8bd7df6b1ba18a037b9"}},{"ruleId":"D1","level":"warning","message":{"text":"detect.detect_file_type (cyclomatic 20): detect.detect_file_type has cyclomatic complexity 20 (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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b965d3d215816a86d6c25e031a2d1bc1e036d55e9066c7a5ab1e8d9c4217f6"}},{"ruleId":"D1","level":"warning","message":{"text":"detect.detect_file_type (cyclomatic 20): detect.detect_file_type has cyclomatic complexity 20 (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":"skills/caveman-compress/scripts/detect.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"def72122187064eed0c91fc7c277a27e17ce697a0361e905da2ef833d39380ad"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-extension-stage.verifyExtensionRoot (cyclomatic 20): verify-extension-stage.verifyExtensionRoot has cyclomatic complexity 20 (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":"extension/scripts/verify-extension-stage.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"46875a0970241be3ae7cf3f3b404599a6e5bbfedec30bd16cc4aa4ade4a06449"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-routing.unforwardedProviderHeaders (cyclomatic 20): provider-routing.unforwardedProviderHeaders has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"packages/cli/src/provider-routing.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca064e635e06578129a46c501966e3e136b2919893b7182ac682292836ac93c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.telemetryTokenDelta (cyclomatic 20): index.telemetryTokenDelta has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5b70cf5244d4da9dc9cd224c6a87e580f6f3f09d8e477679ffcf389cd50dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.importSkill (cyclomatic 20): index.importSkill has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a86266bcaeab99fda8decfd56267c8e7f0f940232c2d1b88dd8140ab62cfe29"}},{"ruleId":"D1","level":"warning","message":{"text":"index.skills (cyclomatic 20): index.skills has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180600309a9f70d2fc963a7187ba65187269ce23acee7f0e42e887e0a00b292"}},{"ruleId":"D1","level":"warning","message":{"text":"index.recoverPendingAgentNativeBundle (cyclomatic 20): index.recoverPendingAgentNativeBundle has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80a2bce6800fda25ec51eac128f0650565a5268a5604d3f42c502ff62a7c889"}},{"ruleId":"D1","level":"warning","message":{"text":"index.mcpUninstall (cyclomatic 20): index.mcpUninstall has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":14747}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd380fc110c623cb5cda1adcce312a6243abb47f57a697a3df76330b1cb8b061"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenWorkspaceTrusted (cyclomatic 20): index.qwenWorkspaceTrusted has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":15520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1703b8c4eaca41fa90f72edbf6755428c9ed0f31a0bdfdaf9b7c3860d00c8e94"}},{"ruleId":"D1","level":"warning","message":{"text":"index.installSettingsHookGeneric (cyclomatic 20): index.installSettingsHookGeneric has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":18239}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d3bec1a5e66bb3805a17bb8cc4d108aae97765950a54e40e0dc7110c4292d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hermesPluginListContains (cyclomatic 20): index.hermesPluginListContains has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":19092}}}],"partialFingerprints":{"codehealthFindingId/v1":"777cbd98fa61e275e6eb2c5eeeb9b632c169bc20b11cfdec0ff5345a97b7540c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.stats (cyclomatic 20): index.stats has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":19601}}}],"partialFingerprints":{"codehealthFindingId/v1":"695bcab0858bf44e9d7fa540bdcbde8991b9a458f29f68f7fee188366137b368"}},{"ruleId":"D1","level":"warning","message":{"text":"index.renderStatus (cyclomatic 20): index.renderStatus has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":21715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9acf59740c9b9b07b941003d17e38fa2fd9a0522d9942df4992529b4021e948"}},{"ruleId":"D1","level":"warning","message":{"text":"index.traceSearchBody (cyclomatic 20): index.traceSearchBody has cyclomatic complexity 20 (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":"packages/cli/src/index.ts"},"region":{"startLine":22424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f2b0ab09a86a8fdf77ec646e1c92b3e11d43c147f5b812e734cd5a8936db82"}},{"ruleId":"D1","level":"warning","message":{"text":"google.selected (cyclomatic 20): google.selected has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 73, 70). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afa0edce8b66535743bb0b52194bd281e3fbb830bb90d6757ccc6e0c4bdec48"}},{"ruleId":"D1","level":"warning","message":{"text":"index.readRunState (cyclomatic 20): index.readRunState has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc0138d2a42bceeef49986cb819df7025d99d58e5e824affb39b0abc719bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"run.parseArgs (cyclomatic 20): run.parseArgs has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a84a6baf48e5895cb6000e943a56403e8f09b7a3d182dd9a271cb749f9eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-stats.findRecentSession (cyclomatic 20): caveman-stats.findRecentSession has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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/hooks/caveman-stats.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"629a624d10277918903678de066138648fa25a256b2dbb2a36b8c2ca0dc042ae"}},{"ruleId":"D1","level":"warning","message":{"text":"CDPDriver.Act (cyclomatic 19): CDPDriver.Act 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":"browse/cdp.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8dbb2a23d120d6ad1bb0e286600e8ffbc62d82c90e2ca018693331e17209c9"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.salvageObjects (cyclomatic 19): ccr.salvageObjects has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"engine/ccr/store_repair.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f0dda7c06bb756aad945fd996e034ed2ec827219705473a9c9c343aa1a57c2"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.droppableGeneric (cyclomatic 19): compressors.droppableGeneric has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d83034991773e0378d3db5431e6370e77bb33d8bb6998eb855ed2044203d47"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.splitLineNumberGutter (cyclomatic 19): compressors.splitLineNumberGutter has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_listing.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55186880be470f50d6e2c69c94001f7c9b9e17088f9c65558afe6a75c55173e"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.RestoreLineNumberedListing (cyclomatic 19): compressors.RestoreLineNumberedListing 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":"engine/compressors/code_listing.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0ccbde9363a68610b9efd8d0730d66aa50468da6c391906d15bfeeb1a5041d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseStatsReportOptions (cyclomatic 19): main.parseStatsReportOptions has cyclomatic complexity 19 (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":"proxy/cmd/caveman-proxy/stats.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d32b1bab259bb89171749ef8ad4060270781d92ba835f1acccf92997db79f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Link.poolAnswer (cyclomatic 19): Link.poolAnswer 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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e2854a216baea4cc576ef51c271c56fb31ef84bafe6739d05037ff77bfe9f5"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.standalonePriceForUsage (cyclomatic 19): gateway.standalonePriceForUsage 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2887b207db862bc2e44b4158a151f1c2be242d4d359ca3beb9d35ce7d7e3a26c"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.appendRetrieveResult (cyclomatic 19): gateway.appendRetrieveResult 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bd40508d2906227edb24fa5ad44a26b1b5eb2be8b098ff8269dbafec994e53"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.UniqueRecentSession (cyclomatic 19): Runtime.UniqueRecentSession 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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"556fcebdff20b42d533da2c75a24c5c0450ea350e90ac09cf6d50614b118608d"}},{"ruleId":"D1","level":"warning","message":{"text":"store.crossProviderSinks (cyclomatic 19): store.crossProviderSinks has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1370676241e522ee00b451bffe25eace2ec9001a0040f28e948bcc0b0a9b175"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionEventConsumer.finish (cyclomatic 19): sessionEventConsumer.finish has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/session_source.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2116c2050b0f2a491a958cf62531bd58e8a78242f25f0de35c1188267262fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.InitMiddleware (cyclomatic 19): Store.InitMiddleware 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":"proxy/internal/store/middleware.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d55d8f043ef11500f4e3f2cf9d9a6d6da7de83e56653c7c422ffeac20d1acf8"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.stripForeignThinking (cyclomatic 19): translate.stripForeignThinking has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. 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":"proxy/internal/translate/messages.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0a0f4a6e41a7903d5af20b253b7c40c8d624b400433c8273b62ff414aa9f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.responsesMessagesBody (cyclomatic 19): translate.responsesMessagesBody 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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fe8da13754d398bb8f13762ed9796f8e9ab1204bb400053d380e7f4d1cd399"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.ApplyResolvedPricingRoute (cyclomatic 19): providers.ApplyResolvedPricingRoute 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":"proxy/providers/adapter.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"726b09dfd818e1f610299efbf2f9a109009a8c9c07b6d8d386c7c4214c783570"}},{"ruleId":"D1","level":"warning","message":{"text":"bedrock.validateBedrockRawTotal (cyclomatic 19): bedrock.validateBedrockRawTotal 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":"proxy/providers/bedrock/usage.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f76924a36b3dab02262232bd5194a2a8b4f540b08f50a7453d5846a944eec59"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanMCPHost._project (cyclomatic 19): CavemanMCPHost._project has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/mcp.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23a8e78fb3394051f0814e40d3a5a7ff4f972ab0cac9f2f921ce8fe1ff3fc2"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.stripJsonComments (cyclomatic 19): settings.stripJsonComments 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":"installer/lib/settings.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbcddf846a251ecfef8742b755633421b3314d66eaf5aa4d2f2a09df48e363c"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.addCommandHook (cyclomatic 19): settings.addCommandHook 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":"installer/lib/settings.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e49d6ddb544c32952ae74f221075f5d67bc155a52a729384c114bb380c31ce"}},{"ruleId":"D1","level":"warning","message":{"text":"apply.moduleStates (cyclomatic 19): apply.moduleStates has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 610, 618, 607). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55158fea5bc4a050c6a8f3f87f1e985b9d72b4de7eec1f63f267f901d03a43"}},{"ruleId":"D1","level":"warning","message":{"text":"index.startOptions (cyclomatic 19): index.startOptions 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":"packages/cli/src/index.ts"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e277400375d217e3db2e684e1b4b57512ea72451b581e65f7036a193a3d7b9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.setupInstallLocked (cyclomatic 19): index.setupInstallLocked 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":"packages/cli/src/index.ts"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0368c2028edc58acdea8c0cfa0a0021e64c14e3c9e0125a27c2789bda436dd3a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.syncLocalPracticeFindings (cyclomatic 19): index.syncLocalPracticeFindings has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":13695}}}],"partialFingerprints":{"codehealthFindingId/v1":"93088001f3fed4faaca69c99b4b233a7afe7516a34ed6eadce27e796d22ce714"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validNativeRuntimeResponse (cyclomatic 19): index.validNativeRuntimeResponse has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17536}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cd348c1ba2436d6ce78de79e9855270c2a4721b24f6a20fd42e3540dace893"}},{"ruleId":"D1","level":"warning","message":{"text":"native-hook-fast.validResponse (cyclomatic 19): native-hook-fast.validResponse has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c7b88470df7e8c779865393ca17acc5386a116717df109ab8e6de172635ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"langchain.createCavemanLangChain (cyclomatic 19): langchain.createCavemanLangChain has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e35d3f84e2e5da88aa7c1b09601394ec4cae8c4291864d808b901144e8d62a"}},{"ruleId":"D1","level":"warning","message":{"text":"OTelExporter.recordSpan (cyclomatic 19): OTelExporter.recordSpan has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f089bdd1e8c9dcad181c607f8dfaed6df5b37a3e51d5fa88a9b30c8ed3ba90fe"}},{"ruleId":"D1","level":"warning","message":{"text":"index.normalizeExperiment (cyclomatic 19): index.normalizeExperiment 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3be041b08ceacd1ee6c273ccc6f46814f0618e1a7fb5bc37cfc1b5487a6da0c"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-stats.main (cyclomatic 19): caveman-stats.main has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"36545f42f7ac4fbe5a9f56a2cbc432596ca7e585156771bdd4b523071ed4d924"}},{"ruleId":"D1","level":"warning","message":{"text":"index.transformResponse (cyclomatic 19): index.transformResponse 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/mcp-servers/caveman-shrink/index.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fb00135dbb2d36a6af9e9e5190f260aceb60bbd835afe1fb333cab0bd416cd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runDirect (cyclomatic 18): main.runDirect 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":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"46adef14be34829f04c391016e1e56c037157e6ef3b4fe97f6668be1897d9b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.summary (cyclomatic 18): Store.summary has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"28317f428d73c4466b73b65550a5bd0c22b475d06c914b29a825fb2e0407cdc9"}},{"ruleId":"D1","level":"warning","message":{"text":"annotationStripper.walkObject (cyclomatic 18): annotationStripper.walkObject 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":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8add3fca29a2010ea02276fb868f8f6db16b4d0febf72f9cb6f15a0108916330"}},{"ruleId":"D1","level":"warning","message":{"text":"main.memTools (cyclomatic 18): main.memTools has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 174, 201, 144, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/cmd/cavemem/main.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d019667d68de6e9384c8a86fa2c195369df6c43308c1df33a3ba537b205f6dc"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runTrial (cyclomatic 18): main.runTrial 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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"115789f973329e227440ecdd199a0f94bea9a207d2cec8746c1da51b1bfd37bb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runUsage (cyclomatic 18): main.runUsage 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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b8e30ffb01870868861fb5a1f849d8c8844983758e904e42584e3368dbfc1c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runRecoveryStore (cyclomatic 18): main.runRecoveryStore has cyclomatic complexity 18 (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":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6834f7ded4e55370a6edb3b8dcc231da4b5dcc162df996353a9c677f97683e"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.prefixModel (cyclomatic 18): gateway.prefixModel has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2b0ce298c5dbfb299e928d11b41ff5fac62e1b4f9cb0c3cc6641524987ff37"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.armCacheWarm (cyclomatic 18): Server.armCacheWarm 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":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cda196b2abc328c64a60e4a5baf32873928e797e933d9f80f3c1161e9ab705"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.pixelRequest (cyclomatic 18): Server.pixelRequest has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/pixel.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e96435dc20ab3c32e87c54b18cfe5b91f817b9dc36614e98175beb7e0e1ed79"}},{"ruleId":"D1","level":"warning","message":{"text":"middleware.requestPresence (cyclomatic 18): middleware.requestPresence 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":"proxy/internal/middleware/presence.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa5cb5467ecc2d6cb41f012c5a7c9fb6885bb91fcddf546357df2559d5add2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.prepareChoice (cyclomatic 18): Runtime.prepareChoice 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":"proxy/internal/middleware/choices.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbbccb2a37a0e9f040c0427d011dd4fe28379a689da362ce474c56e83d2b37"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.optimize (cyclomatic 18): Runtime.optimize has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"68692e33aca022c497643eda947258881caf50cd3c63999e3c4b4c2d82c7a5eb"}},{"ruleId":"D1","level":"warning","message":{"text":"nativehook.currentRepositoryState (cyclomatic 18): nativehook.currentRepositoryState has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"proxy/internal/nativehook/hook.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"538ae53d679a845cb09b7d6219cbc1db525678961ff22868f967165815c1166f"}},{"ruleId":"D1","level":"warning","message":{"text":"store.memoryOrphansSink (cyclomatic 18): store.memoryOrphansSink has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcc828f8af1700a4572a8e7eeaba475a91092ac4c5016d2040d5b8fd0250054"}},{"ruleId":"D1","level":"warning","message":{"text":"store.buildExperimentReport (cyclomatic 18): store.buildExperimentReport 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":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0c564fcbd4d7580c4fa1ff6350bf0521071b32fbd07ec94dd9e404b1ff403b"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.namespaceEvent (cyclomatic 18): translate.namespaceEvent 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":"proxy/internal/translate/translate.go"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead6e22649dd7ff497f1930f4a943b1833df07a46704dbb005efbb6bd2e77a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.ApplyProviderNativeTransforms (cyclomatic 18): Adapter.ApplyProviderNativeTransforms has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"343fdbefc2746677e7859117c82c3f87358419f069525853285d4f3d64c7e259"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.objectMemberSpan (cyclomatic 18): anthropic.objectMemberSpan 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":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7184c97ea4eb2d4a467824a4c51031d82bdb9085edc50c68fe8ee7f72a93977b"}},{"ruleId":"D1","level":"warning","message":{"text":"azureopenai.legacyChatCompletionsRoute (cyclomatic 18): azureopenai.legacyChatCompletionsRoute has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/azureopenai/azure_routing.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"744647f7fa3fbc627ae41db18df3831fa39f1bc11e26021ef3a5d52435b3dffc"}},{"ruleId":"D1","level":"warning","message":{"text":"bedrock.parseBedrockText (cyclomatic 18): bedrock.parseBedrockText 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":"proxy/providers/bedrock/usage.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f17b3bba89cc1faff7c9f7740536cafcfd05943dbd9aee3b6d5f4fa73700fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"postgresconfig.ParsePoolConfig (cyclomatic 18): postgresconfig.ParsePoolConfig has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/postgresconfig/postgresconfig.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c43db53535b65e68061d9ece179fbed490b9d9a63dbf6c7798cbf5a16ab27f"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.extract_indented_code_blocks (cyclomatic 18): validate.extract_indented_code_blocks 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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdbdeec08a4a7435591b272172493882cae3b03bd11b4a7f14116e19959c606"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.extract_indented_code_blocks (cyclomatic 18): validate.extract_indented_code_blocks 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":"skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d1a10edc9c29807199a64656bfeb3982cb26898083447f0533bcacf77984c3"}},{"ruleId":"D1","level":"warning","message":{"text":"learn-autopilot.claimLearnNudge (cyclomatic 18): learn-autopilot.claimLearnNudge has cyclomatic complexity 18 (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":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350dde06208f9b8850276ddfb6d5700f9efda87214a04c53f6ec58c611f747a"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.routingStep (cyclomatic 18): onboard.routingStep has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051830c56b6fbf50df70b56647dcb157912f804fa725a380a00d16d800ba87e"}},{"ruleId":"D1","level":"warning","message":{"text":"learn-trends.learnTrendTable (cyclomatic 18): learn-trends.learnTrendTable has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. 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":"packages/cli/src/learn-trends.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42947d2efd0a6170b999daf96863c78ed938c4b3d60a8fa9a368ebfd4dd21cf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runExternalSkillAdd (cyclomatic 18): index.runExternalSkillAdd has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"060731475e8b0dae4dbb1db26f11c85d98bdd0c8a9442e56a417d5ea080a163a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.parseMcpServerMarkerBytes (cyclomatic 18): index.parseMcpServerMarkerBytes has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"67243e2f61d7c27a1b902a2d72ad4c8a90cfe0c669c44c741fbcb74298ac51c0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.restoreNativeJournalFiles (cyclomatic 18): index.restoreNativeJournalFiles has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea36d6f9948a6740002980c1e9ff905f0d0de1c62e7ad856c84370f56de2a3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenArgsPermitRecovery (cyclomatic 18): index.qwenArgsPermitRecovery 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":"packages/cli/src/index.ts"},"region":{"startLine":16305}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ec769fe45cb1877c7f2ada64603ef97dc4dc1bcff956886d1f8125dafdd994"}},{"ruleId":"D1","level":"warning","message":{"text":"index.renderLearnSpendLines (cyclomatic 18): index.renderLearnSpendLines 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":"packages/cli/src/index.ts"},"region":{"startLine":20254}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f01ba558c9fe06067fde4b04d0f7614cb2e33c660beb88fe51dfa653c4d419"}},{"ruleId":"D1","level":"warning","message":{"text":"index.renderLearnSavings (cyclomatic 18): index.renderLearnSavings 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":"packages/cli/src/index.ts"},"region":{"startLine":20606}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f6642ce3186dabbd5aa4cc3439dd28def392867a53f8aaf348a14fe44e687e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.receiptsVerify (cyclomatic 18): index.receiptsVerify 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":"packages/cli/src/index.ts"},"region":{"startLine":22248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b45cc7cc613649192bae544d46cc5802260f0c1cafad904d066571401943ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.selectMenu (cyclomatic 18): index.selectMenu has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 23317, 23288, 23291, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23278}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd05cf3137fad4ee48bd4668c9f216b667fe060325829d74f34fa5691cfad6"}},{"ruleId":"D1","level":"warning","message":{"text":"native-hook-fast.localGatewayEndpoint (cyclomatic 18): native-hook-fast.localGatewayEndpoint has cyclomatic complexity 18 (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":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db39c20e94b47baa62f4f14bc1fb92692378cd4c5b1441535aa8b18fbdc9225"}},{"ruleId":"D1","level":"warning","message":{"text":"mastra.remember (cyclomatic 18): mastra.remember 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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"269598b0c95ac770fc216d7e5f11ce19e86a8d9b2220be61cb44d9c5c3694118"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicyClient.verifyBundle (cyclomatic 18): RuntimePolicyClient.verifyBundle 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179bbcc18e0f820233d55577c4d6037a686a9cebce0ce30e58e9ac959137ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.compress (cyclomatic 18): index.compress has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"828f8383e62f0d671e20c91b3f6821133649636924f4136b6603277e50c17e99"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.preflight (cyclomatic 18): MiddlewareRuntime.preflight 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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"499aa55197b1e478e5765620a63101ad138cd9f89f998eb6d0d3bc00b84515cd"}},{"ruleId":"D1","level":"warning","message":{"text":"browse.validateSnapshotArgs (cyclomatic 17): browse.validateSnapshotArgs 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":"browse/session.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a4028d2d845e95692e89717855d016ab6b44a485e567d00d75265a198010c"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.actTool (cyclomatic 17): Session.actTool 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":"browse/session.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"766dc668d63772993258d85fdd704b6617b5681484ff0ea1e1c51cc01af46b00"}},{"ruleId":"D1","level":"warning","message":{"text":"ccr.secureSQLiteFile (cyclomatic 17): ccr.secureSQLiteFile 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":"engine/ccr/store_sqlite.go"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55bcdd502216dd8213760ebe655c4747393dd6af6bac36e7e5f4f7764d41171"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.reclaim (cyclomatic 17): Store.reclaim 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":"engine/ccr/store_reclaim.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aef02bd78e6087fdd0aaef7faeafdb99d09e897e8dff341c2c4d08751521bb"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.parseJUnitXML (cyclomatic 17): compressors.parseJUnitXML has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/testreport.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d244e91e2cf15167405eacbb10d0dacd5ba060f4fa9942f0a25bf5b890dae4a"}},{"ruleId":"D1","level":"warning","message":{"text":"textCompressor.compress (cyclomatic 17): textCompressor.compress 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":"engine/compressors/text.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac8a47e3890780eb5c080e5e93e9dddad96aad540c26dff31728feb9b1c1a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"evals.valueMatchesAnyType (cyclomatic 17): evals.valueMatchesAnyType 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":"engine/evals/graders.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10b3df91b0ce1346abf95dfb6f2debc322b802a3fdec03dbec9f7ddd57dcd3"}},{"ruleId":"D1","level":"warning","message":{"text":"evals.summarizeQuality (cyclomatic 17): evals.summarizeQuality 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":"engine/evals/quality.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5376d9da51535587cd3ba15911ad99665c2c6dc3c662533db4b3e4147f8b3c"}},{"ruleId":"D1","level":"warning","message":{"text":"image.DecideWithDetail (cyclomatic 17): image.DecideWithDetail 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":"engine/image/image.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"35994a28cc42cd2fb747fee67568da89b59e5f089cbfd1a017db5219a97bd708"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.Supersede (cyclomatic 17): Store.Supersede 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":"mem/store.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781a4e4ad572b60b9bfca6487500f03067a0f727d2812d060c9d4f5a22c1657"}},{"ruleId":"D1","level":"warning","message":{"text":"effortWire.markAt (cyclomatic 17): effortWire.markAt 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":"proxy/internal/gateway/route.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d3f8e1150ab7d9ce6a7b55e85266947162c92f1d2123196fbfd5b2292ecc9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.routeHeal (cyclomatic 17): Server.routeHeal 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":"proxy/internal/gateway/route.go"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfd41dca7965fa778cb1f7017e116a6995456da880fc3e355fc393a6d0a45f1"}},{"ruleId":"D1","level":"warning","message":{"text":"repointel.gitTrackedFiles (cyclomatic 17): repointel.gitTrackedFiles 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":"proxy/internal/repointel/index.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f952e21c76b06f83737452d097cf7bb7608b49e2931aaa5de63dffea51102"}},{"ruleId":"D1","level":"warning","message":{"text":"store.bashReadPath (cyclomatic 17): store.bashReadPath 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":"proxy/internal/store/detect_reread.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b2dfb6e96cdd1b735a57f0e9bd172ffdb29526d94e00eb582e751db0ccadcb"}},{"ruleId":"D1","level":"warning","message":{"text":"store.retroScanClaudeFile (cyclomatic 17): store.retroScanClaudeFile 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":"proxy/internal/store/learn_retro.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaae995ba322f452d907ff6774b59c22a6ab05a282594681f6466a164093e62"}},{"ruleId":"D1","level":"warning","message":{"text":"store.learnTLDR (cyclomatic 17): store.learnTLDR has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad391fc320c07e96f9684e4c95a76644ee0e8dc55a5f00e56007d96d486368e"}},{"ruleId":"D1","level":"warning","message":{"text":"store.codexPathsUntil (cyclomatic 17): store.codexPathsUntil has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 179, 169, 162). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"786000d2118be7a67dc3d52bfb301a3a95fb44e8cbbafbd2c0a855b0a7ee5fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"sqliteMiddlewareTx.ExpireBatch (cyclomatic 17): sqliteMiddlewareTx.ExpireBatch has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd42474cfe78606923a568c11f6ffe21c05a39df7761bb7732f6c0a77cc9d505"}},{"ruleId":"D1","level":"warning","message":{"text":"geminiSessionSource.scanSession (cyclomatic 17): geminiSessionSource.scanSession 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":"proxy/internal/store/source_gemini.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ac58b928c2fcd620daa0f5efc48c053d305002a2a83ab070ac0e211ababcc2"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.appendResponsesToolOutput (cyclomatic 17): translate.appendResponsesToolOutput has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 841). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb13d1563ca0d0bc1e54b26c25dbed1117001314f26ef4a0a9831981383a958"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.bridgeTools (cyclomatic 17): translate.bridgeTools has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 163). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd7c83842fe2e60da6deefb6b8dc9d960ba77c2a1434642bfd7ea879b039b11"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.injectBreakpointRaw (cyclomatic 17): anthropic.injectBreakpointRaw 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":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"238016e876045ab2476f832cad7136df68daaaf66b0e7933981253ce61f4bd93"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.collectAnthropicBlocks (cyclomatic 17): anthropic.collectAnthropicBlocks 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1eace3c114bacb5a81abacceeb26f581cdfc3c8e692faed652f37835fbf88c"}},{"ruleId":"D1","level":"warning","message":{"text":"Adapter.InspectRequest (cyclomatic 17): Adapter.InspectRequest 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":"proxy/providers/bedrock/routing.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e5999cee6adc3d1987b54eded1accc4e95daf642fd6c9ede55ee7ab693cf4e"}},{"ruleId":"D1","level":"warning","message":{"text":"bedrock.normalizeBedrockCacheDetails (cyclomatic 17): bedrock.normalizeBedrockCacheDetails 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":"proxy/providers/bedrock/usage.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d6cb96cb7c8fe7302496e4a372441ecb028c0f6da0df9533f5fd9db239138"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonsplice.AppendObjectFields (cyclomatic 17): jsonsplice.AppendObjectFields 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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f1b4780e44789f6d7b1f88a4ad5d842e1934ec40961109277a403c4cef95a"}},{"ruleId":"D1","level":"warning","message":{"text":"Provider.Credentials (cyclomatic 17): Provider.Credentials 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":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d26e5dc957727408339850f1cbf52709f22f83518fdb3be5a26f00dd7e9715d"}},{"ruleId":"D1","level":"warning","message":{"text":"ssrf.checkAddr (cyclomatic 17): ssrf.checkAddr 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":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"127684ba8313fa11896f6039af58bff9b189d476006487e7fe2632f6b79ecd44"}},{"ruleId":"D1","level":"warning","message":{"text":"agno._message_view (cyclomatic 17): agno._message_view 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":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c89e70503ca383a817be90bf331d8720b983dbc880c26c7afbca56cf12b74"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanLLM._stream (cyclomatic 17): CavemanLLM._stream 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. This shape REPEATS in the file: one other method here (CavemanLLM._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf0445104d18c72098de397baeba5bedd82c6acb80b1571dba334b7e61b58a0"}},{"ruleId":"D1","level":"warning","message":{"text":"CavemanLLM._astream (cyclomatic 17): CavemanLLM._astream 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. This shape REPEATS in the file: one other method here (CavemanLLM._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b9b674564a61edaed3f3e3057860bd3394d1dee07d3fb575abe5f75e39e6ae"}},{"ruleId":"D1","level":"warning","message":{"text":"llama_index._message_view (cyclomatic 17): llama_index._message_view 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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafed14dc7d51b27997914b723e2c51b02eaf7df4f93bcfbcd95284f5c1610a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Cave.compress (cyclomatic 17): Cave.compress 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"295a52f44678dc3236e384ef86a7da77012b60ed57b73e848d7d30b76803d75f"}},{"ruleId":"D1","level":"warning","message":{"text":"core._policy_guard_passes (cyclomatic 17): core._policy_guard_passes 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed892118e51457326dcaf02258f44edfb0d803ee5214a4df59c0966132080d"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime._http (cyclomatic 17): MiddlewareRuntime._http 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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f45ba44fdea22334f4632951c2d70a874f7618163eaf0b0779160f11bbcac7"}},{"ruleId":"D1","level":"warning","message":{"text":"portable-process.resolveWindowsNodeShim (cyclomatic 17): portable-process.resolveWindowsNodeShim 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":"installer/lib/portable-process.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb56c595e910e82cb79674777330e8665989a7c4b9dde9c5575f46b95bd8bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"command-args.parseCommandArgs (cyclomatic 17): command-args.parseCommandArgs 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":"installer/lib/command-args.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722554ca10509e421adc4715048c940d9014c97eae5707ed5be715c7d9f921e"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-mcp.handleMessage (cyclomatic 17): agent-mcp.handleMessage 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":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47d8ca21710133f72ea6e8212307b48245201e50950dcb764ec86e71674ea82"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard.foundRows (cyclomatic 17): onboard.foundRows has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c9c6b19bb131a599e9702e7273aaec0d17b51b4bc4240e54dbf95b411c0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"stats-cli.renderStatsSummary (cyclomatic 17): stats-cli.renderStatsSummary has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/stats-cli.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"da27ab494d38876a13ebdac35e5b71c7871f124a1802ff763d0c2338ce6e33b8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.start (cyclomatic 17): index.start 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39823a19460441ad2686d1e7987fb70e87f7cc7d04581b1a4369299a6533371"}},{"ruleId":"D1","level":"warning","message":{"text":"index.preflightAgentNativeBundleComponents (cyclomatic 17): index.preflightAgentNativeBundleComponents 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faa7e4cfeec889f3de42f48877833da5309f79126ccf9fce872de0764c1a2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.capabilityInputValue (cyclomatic 17): index.capabilityInputValue 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c905b3e6789a6b575d312fc96de5caa3d89c39cc9a81578852a38d2e7676c8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.resolveCapabilities (cyclomatic 17): index.resolveCapabilities has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"268dfdf351525ba98c8144682627d34d3c39a604af5819383b7bec62f8a48e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.geminiNativeMutations (cyclomatic 17): index.geminiNativeMutations has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9099}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a6cc946cd93900a8a69a8f12775565e44c5fc7595b3335a35a3a20dbe9177"}},{"ruleId":"D1","level":"warning","message":{"text":"index.aiderNativeConfig (cyclomatic 17): index.aiderNativeConfig has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9863}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa3375aaa84fc48b23f8ac8967c8b9e0bcee5cd2a4cc946058200b031b86b1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.installNativeVoiceSkills (cyclomatic 17): index.installNativeVoiceSkills 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d86ab5ab563334c09d1fa1a227030d4295215fe30adaf201fce80a023b60c95"}},{"ruleId":"D1","level":"warning","message":{"text":"index.removeNativeHookEntries (cyclomatic 17): index.removeNativeHookEntries has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10974}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529fd2b2e9b93a9b35668460c7a8f891bee08068ebffa7a5fca22598b8c7771"}},{"ruleId":"D1","level":"warning","message":{"text":"index.disableNative (cyclomatic 17): index.disableNative has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc8100988ab304074dddc99c40e7e7e6d58398ac05e574734411b99649db75d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validateLoginArgs (cyclomatic 17): index.validateLoginArgs 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace761f5eaed187e65c85dae282b9d7af0d8a9eb9ff8512615aa227feefe1915"}},{"ruleId":"D1","level":"warning","message":{"text":"index.syncRequestSpan (cyclomatic 17): index.syncRequestSpan has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f9bef9e25fa8fe38f8e6d6db0bf35a04f2635b450c9d911ac691ee5447ee47"}},{"ruleId":"D1","level":"warning","message":{"text":"index.planRemoveMcpKiloJson (cyclomatic 17): index.planRemoveMcpKiloJson 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. This shape REPEATS in the file: one other method here (index.planRemoveMcpQwenJson) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae05d5ef8b5e9c565e767a3e6ca9038a823640a62692bd5857359866834bf97"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenMigratePolicySettings (cyclomatic 17): index.qwenMigratePolicySettings has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aedc5a55b2b3342c3011e5d4659c50e668439a86ab942e6fa47fc0f255f155b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenSettingsPermitRecovery (cyclomatic 17): index.qwenSettingsPermitRecovery 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39caba5b71dcf3671fffdef9dc6cce74378be0474ffad198bf9671140470ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.planRemoveMcpQwenJson (cyclomatic 17): index.planRemoveMcpQwenJson 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. This shape REPEATS in the file: one other method here (index.planRemoveMcpKiloJson) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16400}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e832445e123428dbfc916e49e1d463f9a671ab3cbef3c1defa3cac4da8281"}},{"ruleId":"D1","level":"warning","message":{"text":"index.agentMcpRequest (cyclomatic 17): index.agentMcpRequest 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6afa0c5e581150a42b4cc7ce75315e2409ba33ab84a54a63ff3bfd2ae697dd"}},{"ruleId":"D1","level":"warning","message":{"text":"google.acceptsRecovery (cyclomatic 17): google.acceptsRecovery has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"103a34ecc54f0a663d11efb00bfd7ba87f78e566afc2ed329ca039b15f6944d5"}},{"ruleId":"D1","level":"warning","message":{"text":"google.invocation (cyclomatic 17): google.invocation has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fd0242f4414e5e9d7cab574459669c924e03932587f453bb1251395f8296d9"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime.optimize (cyclomatic 17): MiddlewareRuntime.optimize 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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4a2cdd3ef28336c86a7e9f03dc4da4d1329f973baedc428c8489cd025f03ff"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveWindowsNodeShim (cyclomatic 17): resolveWindowsNodeShim 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf6fa5671a1f1bdc80537d74294b0ed18799918e2154051744a3b4a23594cae"}},{"ruleId":"D1","level":"warning","message":{"text":"compressors.anomalyIndices (cyclomatic 16): compressors.anomalyIndices 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":"engine/compressors/json.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b148f1ca04ddc09841080bf5e1b0c01f75bdb6e61a0ad2dca51cf4f91aa808dc"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.gatewayFindObjectField (cyclomatic 16): gateway.gatewayFindObjectField 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd276b5cd73b272c9c621b90858a5992dd29c90cc0ae74d8858f5d3dfbaeaad6"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.pairPrefix (cyclomatic 16): gateway.pairPrefix has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"proxy/internal/gateway/route.go"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c762d8289eccda2550869990fc190b0b32e2f0e9c79141df2574e94e6c9d7aac"}},{"ruleId":"D1","level":"warning","message":{"text":"cacheWarmer.scheduleLocked (cyclomatic 16): cacheWarmer.scheduleLocked has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 330). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f9838da21cdccd63177263a7d3a96d8f84ab953ecf365bb9e99425e00f5fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"identity.newOIDCVerifier (cyclomatic 16): identity.newOIDCVerifier has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"proxy/internal/identity/oidc.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9d14f4b97ac4486be6cca0fbaeff4d695f87cd89be65ac185850cb6a98907b"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeruntime.validResponse (cyclomatic 16): nativeruntime.validResponse has cyclomatic complexity 16 (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":"proxy/internal/nativeruntime/server_common.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d62a020e4eaadedb948537794d21feae1abb33a94ec110e2ad862fe1f8e81a4"}},{"ruleId":"D1","level":"warning","message":{"text":"store.memoryHealthSinks (cyclomatic 16): store.memoryHealthSinks has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fe4383fdb613d95d8cf78e9cb99603c026941b8d35259cb51705f2822ba5cd"}},{"ruleId":"D1","level":"warning","message":{"text":"store.duplicateRulesSink (cyclomatic 16): store.duplicateRulesSink 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":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ebf1cf2ad1221147c5d22d69bd1a0d6d4fbbdbc821092e848be8e166bb7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"store.claudeMDSectionSink (cyclomatic 16): store.claudeMDSectionSink 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":"proxy/internal/store/detect_sections.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6b2da07cf3ffe1433cf084cc5906dc7b93467c100499175c89b658e8b538d0"}},{"ruleId":"D1","level":"warning","message":{"text":"store.retroRepeatedStreamCandidates (cyclomatic 16): store.retroRepeatedStreamCandidates has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c64deae0184e95446f05bb1a561a5e12bd5fa638108c681233a5362038ce7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"store.parseAiderHistory (cyclomatic 16): store.parseAiderHistory has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/source_aider.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a64171405f3d9096dbe31b0e52bc50b527403b616f7c8789e0176095240a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"store.parseCodexFile (cyclomatic 16): store.parseCodexFile 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":"proxy/internal/store/usage_import.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"095bf97ac2c35da5341fdb6bcaeb73e8e64b28cf9518faa646fa5904395c0fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgresMiddleware.initMiddleware (cyclomatic 16): PostgresMiddleware.initMiddleware has cyclomatic complexity 16 (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":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"05baa93c3cf4a32cd52967c2d446dc92397ae632cd17439e974d467162da8d77"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.stripBlocks (cyclomatic 16): translate.stripBlocks has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 350). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"54400e344553f6ef722240a969d3c1e41e2c2e245791e701b6c96e205746a19b"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.appendToolMessage (cyclomatic 16): translate.appendToolMessage has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 550). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9541c859650628832026cfa3db88e3580d1b7ae586dfdd7ca5f840e822635e"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.messagesResponsesBody (cyclomatic 16): translate.messagesResponsesBody has cyclomatic complexity 16 (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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0367ec216b3ce18affdc304c4f464f2fb275e2c32ca94c5a7cf7ed730ca221"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.estimateInputTokens (cyclomatic 16): translate.estimateInputTokens 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":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"77082b4777674ce0a933bffdd696e5518ad14433e2aa0f08a9d1fc2ebd2ea051"}},{"ruleId":"D1","level":"warning","message":{"text":"translate.clampEffort (cyclomatic 16): translate.clampEffort has cyclomatic complexity 16 (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":"proxy/internal/translate/responses.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53b5f92af275ef0031104a74dc08ed001d566e70e1f506fab1e369f6b5e53ec"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.contentBlocksCarryBreakpoint (cyclomatic 16): anthropic.contentBlocksCarryBreakpoint 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":"proxy/providers/anthropic/breakpoint_plan.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b701d5051e85cfd776215fe2c727d0bed444e0f3e85c58e814f84d4991ada4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.stripCacheControl (cyclomatic 16): anthropic.stripCacheControl 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":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce26ae38b6ef51de9e3f2880439b60d4f4c70e2624156b8e4752ed9c8cdf29a"}},{"ruleId":"D1","level":"warning","message":{"text":"anthropic.findObjectField (cyclomatic 16): anthropic.findObjectField 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":"proxy/providers/anthropic/splice.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57ad7c05e910f1c45c964a4a2bd52d5527747073d15e654c509b4303e685c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonsplice.Field (cyclomatic 16): jsonsplice.Field 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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a699413c2bea5610a2859b1d04da1efb289b7dd202380f1199765d19ca4c64"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.chatZones (cyclomatic 16): openai.chatZones 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"668f97175e32152fd4b55a9934ac0d2a496dfda7e66e0eb48dab63bcc04dc84a"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.chatRecoveryCallIDs (cyclomatic 16): openai.chatRecoveryCallIDs 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3aa1f07dc9efc9df96169cafbdd26e977610cc327b40052d65d489500dfb5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.findObjectField (cyclomatic 16): openai.findObjectField 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8306b5e10a211b94d51edbb346fcaf4923beb169fd65f5e21f1acc1a4212f3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ssrf.dialContextWith (cyclomatic 16): ssrf.dialContextWith has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf02d318ede8be908e8b36bd3abb92467fc330de27951c094f8db4206c4bd32"}},{"ruleId":"D1","level":"warning","message":{"text":"langchain._message_view (cyclomatic 16): langchain._message_view 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":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3365efb5191f5fdc18ca05cad44198de17cc046ca355d2c21628cd570274b1"}},{"ruleId":"D1","level":"warning","message":{"text":"MiddlewareRuntime._capabilities (cyclomatic 16): MiddlewareRuntime._capabilities 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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"490853068da5b67a497083c82f4435aab45d188e2f7bb95ca1c41c0700c31968"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.page (cyclomatic 16): validate.page has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/validate.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b42b138e14d2da1ab0c35ecbc36134acb2f7c8fe311951e671f1941ecd2193f"}},{"ruleId":"D1","level":"warning","message":{"text":"check-profile-scope.checkProfileScope (cyclomatic 16): check-profile-scope.checkProfileScope has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/check-profile-scope.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a4de5595a382ec7c919db4a2e83e3fcd522976234d21b987cbac3dc0d6999b"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.validateHookFields (cyclomatic 16): settings.validateHookFields has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a57565103b4fa4446a049b8a529d9da41d396fb6e92c25ff86b9b066032606d"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.rewriteLegacyManagedHookCommands (cyclomatic 16): settings.rewriteLegacyManagedHookCommands 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":"installer/lib/settings.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4a313ca25f9eb9bd08fdd368b19702f3dc9e14bce9aafa17e59ce906146775"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-skills.skillsRoot (cyclomatic 16): provider-skills.skillsRoot has cyclomatic complexity 16 (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":"installer/lib/provider-skills.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaf4dea33a8fdaf02bad3748add409cc8b763a85aecad94ce9d8b56acbbfaed"}},{"ruleId":"D1","level":"warning","message":{"text":"index.withIntegrationLock (cyclomatic 16): index.withIntegrationLock has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be7b58507cd16ee5ca73f6f787f2228ae5024c7dc51552d21fc31c2c99fa8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.nativeRoutePinnedFor (cyclomatic 16): index.nativeRoutePinnedFor has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (routeIn). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10703}}}],"partialFingerprints":{"codehealthFindingId/v1":"534b468e2762f63969d0c0bf43cee8ba89b2aa60f7701405be15b1f6a5893b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.applyConfigFileInjection (cyclomatic 16): index.applyConfigFileInjection 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12252}}}],"partialFingerprints":{"codehealthFindingId/v1":"25742485a3aadedf76abd326e59b6722369ab6e59930829797495c57038540ff"}},{"ruleId":"D1","level":"warning","message":{"text":"index.planMcpKiloJson (cyclomatic 16): index.planMcpKiloJson 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15072}}}],"partialFingerprints":{"codehealthFindingId/v1":"0825a7de930c595f5b501d3efdc02670e471a2f4098badb83016870b913c0e52"}},{"ruleId":"D1","level":"warning","message":{"text":"index.qwenEnvironmentFilePaths (cyclomatic 16): index.qwenEnvironmentFilePaths has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15639}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0d13595ebccf83cf0028911bab8858207c03c5b64d025f1cca8ab6f5bde6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.hooksDirectiveCmd (cyclomatic 16): index.hooksDirectiveCmd 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4cb5419dea1594e7741360cf7bc52a4bbb9123b333c280329d49436012c393"}},{"ruleId":"D1","level":"warning","message":{"text":"index.learnSummaryMoves (cyclomatic 16): index.learnSummaryMoves 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eebd267b8c43ffa7751a1f5d95368cf12b0aa84c014c05d445574fa3fe93de5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.embeddedReceiptKeys (cyclomatic 16): index.embeddedReceiptKeys has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22209}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8f046a38524327ad3597f58653798d9c9de5bd19e552b95524e431e868dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"index.config (cyclomatic 16): index.config has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: index.privateVerificationURL (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22837}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba04a7b58437a8ba4d56841aec512ad47a85e3e4f481dffaa7cc1b9523d26e4"}},{"ruleId":"D1","level":"warning","message":{"text":"wire.parseWire::walk (cyclomatic 16): wire.parseWire::walk 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":"packages/middleware/typescript/src/wire.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d775e3e4ca5b2bc9432db1c21432876afbc875be2234ada57097891a75b292a2"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.sanitizeHookResponse (cyclomatic 16): protocol.sanitizeHookResponse has cyclomatic complexity 16 (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":"packages/pi-extension/src/protocol.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb4d8cf579b7e41f006b42cc313f3fe36e8f78260c6bc127634b8dc50878b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.isValidPolicyDoc (cyclomatic 16): index.isValidPolicyDoc 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8542a323460604e7ac67a0bf0781c0d04e12108b4639b902cab3c901550becb4"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.createNodeTransport.boot (cyclomatic 16): transport.createNodeTransport.boot has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. 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":"packages/sdk/typescript/src/middleware/transport.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179358fe153d5b5430093a033d4d1e2b4aff27dbbfcd99e663da5ba13fd7ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman-config.appendFlag (cyclomatic 16): caveman-config.appendFlag 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/hooks/caveman-config.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94158f2e94b15058b4cf72634a54e3b5f40102b9494ba81dd847fd9d922afd4"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.validEngineSession (cyclomatic 16): ingest.validEngineSession has cyclomatic complexity 16 (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":"supabase/functions/cli-telemetry/ingest.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae8666c270c393bdedeb7ffd93d04ea6f91b7b3da810fcb2a11eb341fe2ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"collectUsage (cyclomatic 16): collectUsage has cyclomatic complexity 16 (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":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71302eb080aeda1d79b778dcc6c45383b7da861354df2651c59aa3e73d4c7298"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeCapture (cyclomatic 16): analyzeCapture has cyclomatic complexity 16 (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":"packages/subagent-tax/lib/analyze.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed10620308fed2fca31ec8edec8c604327f1d306176d76ce0f6256d4a254194"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.proxy (cognitive 340): Server.proxy has cognitive complexity 340 (threshold 15). Drivers by points: if/else 137 (238 pts), boolean chains 86, match/switch 7 (15 pts), loops 1 (nesting depth added 109). Of this number, 338 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6b28f02e5e8b8ff23e69121599222e47ab759c520fb07199a0f62d489d24ab"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall (cognitive 337): uninstall has cognitive complexity 337 (threshold 15). Drivers by points: if/else 102 (197 pts), error handling 19 (53 pts), boolean chains 43, ternaries 12 (36 pts), loops 5 (8 pts) (nesting depth added 156). Of this number, 328 points are the body\u0027s own statements and 9 belong to 7 function items inside it that branch. 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":"installer/install.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9885649f306b965d44a6d3aee085873fa8620c44c126f4947b71cbaadf32ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.restoreNativeOperation (cognitive 210): index.restoreNativeOperation has cognitive complexity 210 (threshold 15). Drivers by points: if/else 68 (128 pts), boolean chains 39, ternaries 16 (36 pts), loops 3 (7 pts) (nesting depth added 84). 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":"packages/cli/src/index.ts"},"region":{"startLine":11020}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa29eac2b3649c871a4afb084c9d4446a1df41c0f2cfaf8c5a3f4ef89d1a93e9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.spawnWrapped (cognitive 163): index.spawnWrapped has cognitive complexity 163 (threshold 15). Drivers by points: if/else 51 (78 pts), boolean chains 48, ternaries 23 (34 pts), loops 1 (2 pts), error handling 1 (nesting depth added 39). Of this number, 162 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":6650}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea4d59e1e08f49fff00ee5bfdab340ef14ebd574597ec4f7e695ce9966372d"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.onboard (cognitive 145): onboard.onboard has cognitive complexity 145 (threshold 15). Drivers by points: if/else 38 (63 pts), ternaries 24 (62 pts), boolean chains 9, loops 5 (7 pts), error handling 2 (4 pts) (nesting depth added 67). Of this number, 141 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. 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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb04cccf4fcbe827399681fc69900333803eae8fbcb1173963a78f3abb44c9"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.summarizeElided (cognitive 142): compressors.summarizeElided has cognitive complexity 142 (threshold 15). Drivers by points: if/else 33 (114 pts), loops 7 (11 pts), match/switch 3 (10 pts), boolean chains 7 (nesting depth added 92). 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":"engine/compressors/invariants.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aba0b2cd253b6423818b6bbe09035d305b718ab44ad613ed8881892f5dd237"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncAutoEntries (cognitive 112): index.syncAutoEntries has cognitive complexity 112 (threshold 15). Drivers by points: if/else 22 (73 pts), loops 4 (12 pts), ternaries 3 (12 pts), boolean chains 10, error handling 2 (5 pts) (nesting depth added 71). Most of this is not in the body itself: 3 of the 112 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4358, 4361). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba48384c3e0d044d4fdc05ce998f8d9a06a3f188f712af11f5b0f5a062439ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"_native.leaves (cognitive 110): _native.leaves has cognitive complexity 110 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 11 (27 pts), boolean chains 20, ternaries 2 (9 pts) (nesting depth added 58). 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":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc9b0b7677aab30d24829a0116e4d02d87dd7b095f1e8b97c72aac09eaff466"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.rewriteRequest (cognitive 107): Server.rewriteRequest has cognitive complexity 107 (threshold 15). Drivers by points: if/else 42 (83 pts), boolean chains 12, loops 7 (12 pts) (nesting depth added 46). Of this number, 95 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07d071fd3453a6131de955198b2432d5b3c252a8fc79b86d0880bebfe84fcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenRouteOverride (cognitive 103): index.qwenRouteOverride has cognitive complexity 103 (threshold 15). Drivers by points: if/else 41 (76 pts), boolean chains 16, ternaries 2 (6 pts), loops 3 (5 pts) (nesting depth added 41). Of this number, 102 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16085}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f042c70d4190be11446948fd5bc1660ffb1c4bae90cc3f0340029642868aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeIntegrationStatus (cognitive 102): index.nativeIntegrationStatus has cognitive complexity 102 (threshold 15). Drivers by points: ternaries 33 (68 pts), boolean chains 24, if/else 7 (9 pts), loops 1 (nesting depth added 37). 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":"packages/cli/src/index.ts"},"region":{"startLine":11588}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f286265a6ac715ca9627b254eb48a63bcfc8b6ae1635ed0d9b405a44195427"}},{"ruleId":"D2","level":"warning","message":{"text":"index.enableNative (cognitive 98): index.enableNative has cognitive complexity 98 (threshold 15). Drivers by points: if/else 21 (51 pts), ternaries 12 (38 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 58). Of this number, 53 points are the body\u0027s own statements and 45 belong to one function literal inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7fb3dd1b4ec576cde3ca467cbe8457bbd9d4a53ee9e1c0550ac83b829136d"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-leaves.selectLeaves (cognitive 95): provider-leaves.selectLeaves has cognitive complexity 95 (threshold 15). Drivers by points: if/else 29 (49 pts), boolean chains 32, ternaries 4 (9 pts), loops 2 (5 pts) (nesting depth added 28). Most of this is not in the body itself: 12 of the 95 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 32, a function literal at line 71, a function literal at line 54, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fbeb82b04064622451efba5ed6815b5058f28490688c0d6c7a6e7a4bf9c9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.BuildStatsReport (cognitive 92): Store.BuildStatsReport has cognitive complexity 92 (threshold 15). Drivers by points: if/else 37 (71 pts), boolean chains 13, loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 36). 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":"proxy/internal/store/stats.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a454de9bce1df9ec931271ef8dde1b76725b0127d46eca814331fbdb31addc8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeHook (cognitive 91): index.nativeHook has cognitive complexity 91 (threshold 15). Drivers by points: boolean chains 34, if/else 24 (28 pts), ternaries 14 (23 pts), error handling 4 (6 pts) (nesting depth added 15). Of this number, 88 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18043}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06fedee94c8543f780bb75c1869be42b6e02d551a9ff6a071eb35cd3973bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"installOpencode (cognitive 87): installOpencode has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (44 pts), ternaries 7 (21 pts), boolean chains 11, error handling 3 (8 pts), loops 3 (nesting depth added 37). 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":"installer/install.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2215c2a3cc7ac609ea81b77d7f3dc72c5530f3eba75ed5755017970b2a512b"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.optimize (cognitive 85): MiddlewareRuntime.optimize has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 19 (34 pts), if/else 23 (30 pts), boolean chains 14, error handling 5, loops 2 (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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb292f173806a08845ff53fdf71b2c8042173d55937edbc5cdbe08887568370"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.chatgpt (cognitive 83): Server.chatgpt has cognitive complexity 83 (threshold 15). Drivers by points: if/else 41 (65 pts), boolean chains 15, match/switch 1 (3 pts) (nesting depth added 26). Of this number, 77 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0179f471601a7e700955cf4976cb425c9b00ce89d9ba3008fe8ff8cd62b7c04d"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.validateJSONSchema (cognitive 82): evals.validateJSONSchema has cognitive complexity 82 (threshold 15). Drivers by points: if/else 23 (58 pts), loops 5 (14 pts), boolean chains 9, match/switch 1 (nesting depth added 44). 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":"engine/evals/graders.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cb5cfe801db12f557fd86400f80b5fd43ec0a6f8b99b89929634099af2954e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cave.assemble (cognitive 82): Cave.assemble has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (61 pts), loops 3 (10 pts), boolean chains 7, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 42). 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f5b226c8053e0b1157c3f7a2010f2c0f9f5bb7d5f54aaf51a8dd8464501849"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.streamChatToResponses (cognitive 80): translate.streamChatToResponses has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (66 pts), loops 4 (7 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 45). Of this number, 75 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"396ad48840394ff416465c1c35f8cac6350e5dfc0cb637f4bb21c5179e949562"}},{"ruleId":"D2","level":"warning","message":{"text":"validate (cognitive 80): validate has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 31, loops 5 (6 pts), ternaries 1 (2 pts) (nesting depth added 18). Of this number, 76 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. 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":"agents/compile.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f52124d47778e4f976d1a7f0994c6e8023c17f107ba2af85c26308047c27acb"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.stripRetrieveCall (cognitive 79): gateway.stripRetrieveCall has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (64 pts), loops 6 (14 pts), boolean chains 1 (nesting depth added 47). 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2643cb1528eab2135677247fee8b5f5e413ba97b8721a466a15a79c07a58f001"}},{"ruleId":"D2","level":"warning","message":{"text":"Reply.relay (cognitive 79): Reply.relay has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (57 pts), boolean chains 17, match/switch 2 (4 pts), loops 1 (nesting depth added 33). 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":"proxy/internal/translate/translate.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e717f9b5b457b447887bdd744efde98b564ef697abe3df839d413c1f5e43000b"}},{"ruleId":"D2","level":"warning","message":{"text":"install.installClaude (cognitive 79): install.installClaude has cognitive complexity 79 (threshold 15). Drivers by points: if/else 27 (42 pts), ternaries 6 (18 pts), boolean chains 11, error handling 3 (8 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":"installer/install.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70e9d01f0d5a05eac7abadccf5886e58adbbb96a7b4d664c176d9c69480457"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.chatGPTAuto (cognitive 78): Server.chatGPTAuto has cognitive complexity 78 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 21, match/switch 2 (3 pts), loops 1 (nesting depth added 21). Of this number, 77 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0854753e5d82833f5b1f4ac9643c3185b4d1e934fcf6537f265002e3e5d74390"}},{"ruleId":"D2","level":"warning","message":{"text":"index.validateReceiptContent (cognitive 78): index.validateReceiptContent has cognitive complexity 78 (threshold 15). Drivers by points: if/else 37 (54 pts), boolean chains 23, 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":"packages/cli/src/index.ts"},"region":{"startLine":22070}}}],"partialFingerprints":{"codehealthFindingId/v1":"8863b6069e3bac3d81b5d7f1f7f3cfe51cfdbff45e49440a0c5bec7bd8cf9956"}},{"ruleId":"D2","level":"warning","message":{"text":"run (cognitive 75): run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (40 pts), ternaries 9 (14 pts), boolean chains 10, error handling 5 (7 pts), loops 2 (4 pts) (nesting depth added 23). Of this number, 53 points are the body\u0027s own statements and 22 belong to 9 function items inside it that branch. 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/hooks/caveman-activate.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb0719d26909d035578374b4c0022272ea120feed63f3e3f4e2bdd87ac561cf"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.streamResponsesToChat (cognitive 74): translate.streamResponsesToChat has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (59 pts), loops 2 (6 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aa71fc136dd9bcdc6fc77a4466ce32ea3ad8953f780719e9a3bd8be084daba"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.requestPricingUnsupportedReason (cognitive 73): providers.requestPricingUnsupportedReason has cognitive complexity 73 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 6 (12 pts), boolean chains 11, match/switch 2 (5 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"32486f1965deb988de7a05883edf2d8782b3665b3af83b382ac14e430fffd7db"}},{"ruleId":"D2","level":"warning","message":{"text":"responsesToMessages.consume (cognitive 71): responsesToMessages.consume has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 10, match/switch 3 (7 pts), loops 1 (3 pts) (nesting depth added 36). 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":"proxy/internal/translate/messages_responses.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"40828d04452660b89c2b65d61534f6fb7e4a588f4b90552f71d619e6fc946b01"}},{"ruleId":"D2","level":"warning","message":{"text":"store.scanConfirmedFixMetrics (cognitive 70): store.scanConfirmedFixMetrics has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 9 (18 pts), boolean chains 8 (nesting depth added 36). Of this number, 24 points are the body\u0027s own statements and 46 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbded3fd5ce6dcd47dcda14133c6a3627fd17a791ee8a88956852523e4df14eb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.buildWrapEnv (cognitive 70): index.buildWrapEnv has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (43 pts), boolean chains 12, ternaries 5 (8 pts), error handling 2 (5 pts), loops 1 (2 pts) (nesting depth added 24). 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":"packages/cli/src/index.ts"},"region":{"startLine":12562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5686e008689778aef020bc23f9c55e11123a6bb1b4f64cc43ee03d5fe79eb47"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 70): main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 33 (50 pts), boolean chains 13, loops 4 (7 pts) (nesting depth added 20). Of this number, 69 points are the body\u0027s own statements and 1 belongs to 7 function items inside it that branch. 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":"installer/install.js"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"521be3e426f709ae4c3ef97b7813581a22e99faf22e0363f500bf318c5754e39"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cleanClaudeProfile (cognitive 67): index.cleanClaudeProfile has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 8, loops 3 (8 pts) (nesting depth added 35). Of this number, 53 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0ef1213c23673858ae2425ad69b698cd1436da3a69a23d20447a98c3a57ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.planModules (cognitive 66): apply.planModules has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 12 (26 pts), if/else 9 (16 pts), loops 9 (14 pts), boolean chains 5, error handling 2 (5 pts) (nesting depth added 29). Of this number, 63 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb20fc9f74cf335308bc0cea8567258f48d35bda2f837882f676f018ee3ead"}},{"ruleId":"D2","level":"warning","message":{"text":"handle (cognitive 66): handle has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (39 pts), boolean chains 16, ternaries 4 (8 pts), error handling 2 (3 pts) (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/hooks/caveman-mode-tracker.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95fa3afa076478a623ad30388e7ad45b340431e471cdddc3a9efdf441189ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.writeReceipt (cognitive 65): Runtime.writeReceipt has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 9, match/switch 3 (7 pts), loops 1 (nesting depth added 30). 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":"proxy/internal/nativeruntime/receipt.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"88607a620b2f27fe503841de9a90cc63da7b4419fc2258ff17f0e764b067b109"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.streamAnthropicToChat (cognitive 65): translate.streamAnthropicToChat has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (53 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 40). 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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"56488ccfff684545a47ea8a33fca3889ed5e7664fea7f9ef0fcbb38ce20d48bb"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.applyModules (cognitive 65): apply.applyModules has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 10 (20 pts), loops 7 (10 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 22). Of this number, 60 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee71c9114392cfd900f932a740ee70830fea4458fa273f83075722f2a76dfa25"}},{"ruleId":"D2","level":"warning","message":{"text":"index.kiloRouteOverride (cognitive 65): index.kiloRouteOverride has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 9, ternaries 3 (6 pts), loops 1 (nesting depth added 30). 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":"packages/cli/src/index.ts"},"region":{"startLine":15858}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11076441bd8a05ffa7708a878ca50028662cf2b44afe5993b257c8d8beac7ea"}},{"ruleId":"D2","level":"warning","message":{"text":"index.assemble (cognitive 65): index.assemble has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 3 (11 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1 (nesting depth added 31). Of this number, 55 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec31e781c0131658fae0cebe8df8b34e639d7c5c92a4aeb148f5cfe4dbfb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.perMessage (cognitive 64): gateway.perMessage has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 11, loops 3 (4 pts), match/switch 1 (nesting depth added 25). Of this number, 59 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4b34585608b140d73bc4929f13d7ae98d6069bca8d6247a307ae3576a808ef"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.mergeSnakeUsage (cognitive 64): providers.mergeSnakeUsage has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (52 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 26). 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":"proxy/providers/adapter.go"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ddf703c6f4cbc9096d9591a5bd4e2ab001cb627b8a3070e281867dffd9b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.setup (cognitive 64): index.setup has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 5 (16 pts), ternaries 6 (13 pts), boolean chains 12 (nesting depth added 26). Of this number, 24 points are the body\u0027s own statements and 40 belong to 5 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef7dbf744c1d242c46ac28d994ce8dced6b420d67b5022fc9167eeba3116009"}},{"ruleId":"D2","level":"warning","message":{"text":"ai-sdk.project (cognitive 64): ai-sdk.project has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 16, loops 5 (8 pts), ternaries 4 (7 pts) (nesting depth added 25). Of this number, 60 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3646848e9d3e3a538e50b8809e469965dd3a7fad8a3f35ce71864a43840d09"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.focusAXRecords (cognitive 63): compressors.focusAXRecords has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 11 (19 pts), boolean chains 9 (nesting depth added 28). 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":"engine/compressors/axtree.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf5bba52c2d60b94e1906765d199fc9fded6c952a7face510dc9e03d6859424"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.containsNonTextInput (cognitive 63): gateway.containsNonTextInput has cognitive complexity 63 (threshold 15). Drivers by points: if/else 11 (46 pts), loops 3 (9 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 45). 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":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd099dfa4065066fe33f0d74297843d5b83b8af6b207bc78904dcf224903dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"index.status (cognitive 63): index.status has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 22 (27 pts), if/else 21, boolean chains 15 (nesting depth added 5). Of this number, 60 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":21760}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e15a8c7499da9377d6ad826cd2a2937cc54fa957214a83a218f77e70bc609d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.applyEffort (cognitive 62): Server.applyEffort has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 22, loops 1 (2 pts), match/switch 2 (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":"proxy/internal/gateway/route.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"588f61c0e95cd534752836e63f1ba8b5068bd335916f05f38e87b91b8597a03f"}},{"ruleId":"D2","level":"warning","message":{"text":"install.installHooks (cognitive 62): install.installHooks has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (20 pts), error handling 7 (13 pts), boolean chains 10, ternaries 7 (10 pts), loops 6 (9 pts) (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":"installer/install.js"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ea2ce6e4e806d51a515c141115dfb061da86628c72928cdb1bf9146cb1b96d"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonCompressor.selectArray (cognitive 61): jsonCompressor.selectArray has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 13 (21 pts), boolean chains 3 (nesting depth added 28). Of this number, 48 points are the body\u0027s own statements and 13 belong to 3 function literals inside it that branch. 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":"engine/compressors/json.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff0c8f543f1738805436503275fa62be2b9ee1f7ac72136c36c970f48cba2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.learn (cognitive 61): index.learn has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (27 pts), ternaries 9 (22 pts), boolean chains 10, error handling 1 (2 pts) (nesting depth added 22). Of this number, 56 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":20889}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae67ec97ceb28cef24128c24d57eea3f808b18f46c1d14d7108faf7e7d11ca54"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.chatResponsesBody (cognitive 60): translate.chatResponsesBody has cognitive complexity 60 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 8, match/switch 4 (5 pts), loops 1 (2 pts) (nesting depth added 21). Of this number, 33 points are the body\u0027s own statements and 27 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6feb2d46639883c188b682b15dcfee2b0ecffe9559d34e00e56eb9d92a33e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderRouter.apply (cognitive 60): ProviderRouter.apply has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 9 (18 pts), boolean chains 9, error handling 4 (7 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":"packages/pi-extension/src/provider.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0f2b385226c6344738cf15669ac1a0048223dc2d02a3d7e5e5a060e20573e"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-parse.parseModeChange (cognitive 60): caveman-parse.parseModeChange has cognitive complexity 60 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 14, ternaries 3 (9 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/hooks/caveman-parse.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caa9f81ae057b7d1926838cdbe00963c38d36a36450925a36e5af03e77bd37d"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.respond (cognitive 59): Runtime.respond has cognitive complexity 59 (threshold 15). Drivers by points: if/else 30 (49 pts), boolean chains 8, loops 1, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d2a685b30641f0dba19ca5e4c10683bc28b19e9f2039f95e26d5e2d66c1bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.streamAnthropicToResponses (cognitive 59): translate.streamAnthropicToResponses has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 4 (11 pts), boolean chains 3, loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa70a25dcdd4534ec48a1bfe963d9b1db6a589774c1e792d05ba4d55a166fda"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.modulesDoctor (cognitive 59): doctor.modulesDoctor has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 6 (18 pts), loops 7 (8 pts), boolean chains 4, error handling 1 (2 pts) (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":"packages/cli/src/modules/doctor.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c1c54170ed2309d506a6584a49d30710590c5033bf2d037f9a892e4792db0"}},{"ruleId":"D2","level":"warning","message":{"text":"install.installGemini (cognitive 57): install.installGemini has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (25 pts), error handling 6 (16 pts), boolean chains 9, ternaries 2 (7 pts) (nesting depth added 22). Of this number, 45 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3dcb90f335b5b606d35492b50ab2310d3b5bdfc1fc9dffc1fa854e90574b67"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeIntegrationStatus.files (cognitive 56): index.nativeIntegrationStatus.files has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 7 (21 pts), boolean chains 18, if/else 14 (15 pts), error handling 1 (2 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":"packages/cli/src/index.ts"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee50cbc27158f8d2fbc0348f9aeb449adc53400e83ff8ba0044010033f9504a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeDoctor (cognitive 56): index.nativeDoctor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 14, ternaries 9 (13 pts), loops 1 (3 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":11867}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc884d00b101ab01f0d7719bb3919a74e2862985585ff3ee4e8cbdf6b4c4698"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderLearnPlan (cognitive 56): index.renderLearnPlan has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (35 pts), ternaries 8 (19 pts), boolean chains 2 (nesting depth added 27). 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":"packages/cli/src/index.ts"},"region":{"startLine":20291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba77ceb3eb06480d4e5c6604a7231ed402142a4b94b4af6b6a2311812ef66a97"}},{"ruleId":"D2","level":"warning","message":{"text":"index.mcpInstall (cognitive 55): index.mcpInstall has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 6 (21 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 24). Of this number, 38 points are the body\u0027s own statements and 17 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16780}}}],"partialFingerprints":{"codehealthFindingId/v1":"2680100ea4cca4664a811a302818f39b3a627ff33c05b1895c4a66348c103b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.validate (cognitive 55): validate.validate has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 7, loops 3 (7 pts), ternaries 2 (5 pts) (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":"packages/shared/contracts/scripts/validate.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"994fb2da6f248bc5bd51600d93930d4aa895d5048a6f1bf8077dabd260dd1996"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.responsesChatBody (cognitive 54): translate.responsesChatBody has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 27). 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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3231c50b78c504cd3216eeaaa6cd3117be295117a066c97c7a576de92f02cbfb"}},{"ruleId":"D2","level":"warning","message":{"text":"google.project (cognitive 54): google.project has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 11, ternaries 3 (9 pts), loops 1 (6 pts) (nesting depth added 30). 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":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6914f5d700db5bae27fec4a6fd9e65dac628c39a439ba440eeb8b568b5eeab47"}},{"ruleId":"D2","level":"warning","message":{"text":"index.agentShortcut (cognitive 53): index.agentShortcut has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 11, ternaries 6 (9 pts), error handling 3 (4 pts), loops 2 (nesting depth added 11). Of this number, 48 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53b54531ed3bc96d964b493a6393093122b900443d8ad0b1611d2cad7159aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"mastra.createProcessor.prepare (cognitive 52): mastra.createProcessor.prepare has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 13, loops 4 (8 pts), ternaries 2 (6 pts) (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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413f5c94b6f16d16edd76483ff1fe76be962e95d7173deeca474f7f0bd9de2f"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-config.safeWriteFlag (cognitive 52): caveman-config.safeWriteFlag has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (36 pts), error handling 7 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 23). 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/hooks/caveman-config.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa1fac24ad7846a2baf3e9e0097067cd02555c58f1fef4052ab138b24169638"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.serveTarget (cognitive 51): Server.serveTarget has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 13, match/switch 2 (3 pts), loops 1 (nesting depth added 11). Of this number, 49 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/route_pool.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde3004ea52db5b83782f92be0e284167ef8b93fe1585127f99da27bf653f11"}},{"ruleId":"D2","level":"warning","message":{"text":"store.simulateLearnPlan (cognitive 51): store.simulateLearnPlan has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 6, loops 5 (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":"proxy/internal/store/learn_simulate.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6ceff80c9cb6b2fc1e597198aa3829368def80549faa4bfed322c8a05c7991"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.createCavemanFetch.cavemanFetch (cognitive 51): transport.createCavemanFetch.cavemanFetch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 8 (15 pts), boolean chains 10, error handling 1 (2 pts) (nesting depth added 18). 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":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"007de6fa2a6973c420e9a56070ebc8ad4d2599ad69f2642671f29fc9e568208c"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.Grade (cognitive 50): evals.Grade has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). 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":"engine/evals/graders.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3cd73a90c4ddf5e2bb906a54621cd1ab3c60ce94b5ed6e7f8b1df2a5671ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.buildOpenClawOverlay (cognitive 50): index.buildOpenClawOverlay has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 11 (21 pts), boolean chains 4, loops 1 (2 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":"packages/cli/src/index.ts"},"region":{"startLine":12111}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6972111800c954bdfbfa9ca1aec61a520b8bbd8e173212e93d51039c1ff96"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hooksCmd (cognitive 50): index.hooksCmd has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (38 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2, error handling 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":"packages/cli/src/index.ts"},"region":{"startLine":19470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e581050f6f66e1c2259b5d8be064f1f71561682df5ade55e4efc3277307e683"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runLearn (cognitive 49): main.runLearn has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 24). 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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bfe3b9a88b8648a1741d5461323a6bab616eae8f2c2a67ea86ee612ef30d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.ask (cognitive 49): Link.ask has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 5 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 15). Of this number, 41 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"56522552dfe132b70645e0cd4df569d94cbc804aa97bc46d901f8ad2cc079138"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.ServeHTTP (cognitive 49): Runtime.ServeHTTP has cognitive complexity 49 (threshold 15). Drivers by points: if/else 30 (42 pts), boolean chains 5, match/switch 2 (nesting depth added 12). Of this number, 41 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"proxy/internal/middleware/http.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e226dd71e96c2a974b39aa720364dcd3a378ce94488e233ed2f01cb76223cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.replayCompressionMove (cognitive 49): Store.replayCompressionMove has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 23). Of this number, 48 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8083ff61ae16b1ffbef147ad342f72d87a3adc483899f574c68dcb60d754b35"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.responsesZones (cognitive 49): openai.responsesZones has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 11, loops 3 (4 pts), match/switch 2 (4 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"740307eb3caa14148c9b5d108032dd47362a1906b906c913e60909629e8dba86"}},{"ruleId":"D2","level":"warning","message":{"text":"collectInjectionModelIds (cognitive 49): collectInjectionModelIds has cognitive complexity 49 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (17 pts), boolean chains 10 (nesting depth added 27). 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":"agents/compile.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1c0fd3f079afb73511011194e60c037235ae6f3407082d9d7292f2f55b2b33"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.consolidateRepositoryMaps (cognitive 48): Store.consolidateRepositoryMaps has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 26). 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":"engine/ccr/store_reclaim.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b757d94ecc4c7cc97321240ac7ed4207268c5bcdc6f6dcbd55574413ac33265"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.publish (cognitive 48): Runtime.publish has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (37 pts), loops 6 (7 pts), boolean chains 4 (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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c742e3bb09aab437981b4eb5bf21fc9a96a6579d4caf80cce031b4ebdfd6993"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runCavemanDeviceFlow (cognitive 48): index.runCavemanDeviceFlow has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (28 pts), ternaries 4 (11 pts), boolean chains 6, error handling 1 (2 pts), loops 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":"packages/device-auth/src/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"59248d27a37f26f4751c1cafe17c57e26ebcecdbc1984f44d63083bc6aaa91ca"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.chatMessagesBody (cognitive 47): translate.chatMessagesBody has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 7, loops 2 (5 pts), match/switch 1 (nesting depth added 14). Most of this is not in the body itself: 13 of the 47 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"487630ca4c2ddb8bbbcb3674d84b1f68bffe5e1fb792fd0f5c7615744caddbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanASGIMiddleware.__call__ (cognitive 47): CavemanASGIMiddleware.__call__ has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 7, error handling 5 (6 pts), loops 1 (nesting depth added 9). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/asgi.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"773316c3024823990328e4c611c03231674ad5657b6c428795f04668bd00196b"}},{"ruleId":"D2","level":"warning","message":{"text":"owned-install.installOwned (cognitive 47): owned-install.installOwned has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (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":"installer/lib/owned-install.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"309d466600b0366499b2c8bd2897a340663bdc09c7b661f0d9756fec48bc0a18"}},{"ruleId":"D2","level":"warning","message":{"text":"index.transformResponse (cognitive 47): index.transformResponse has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 5 (12 pts), boolean chains 4 (nesting depth added 30). 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/mcp-servers/caveman-shrink/index.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd99c7f002d3192a07d4d31ab88c5086ba74d75609d106645816ba55f52d8667"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionEventConsumer.consume (cognitive 46): sessionEventConsumer.consume has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 6, loops 4 (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":"proxy/internal/store/session_source.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9692f8e1d1c2c940e9d597ef69b5e6162f615fd5fa3fe23c6ea5abd765f546f"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.parseUsageBytes (cognitive 46): providers.parseUsageBytes has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 9, match/switch 1 (3 pts), loops 1 (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":"proxy/providers/adapter.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727cafba25afbe19a8d2717e6c2a4a8492438ab8f7bc444bcee3c6a3e60b3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.mask_code_blocks (cognitive 46): compress.mask_code_blocks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (14 pts), boolean chains 8, ternaries 2 (4 pts) (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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0d5ecbd8c95f5905307528781842c697abbd3476c441030126cb14180509e"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.mask_code_blocks (cognitive 46): compress.mask_code_blocks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (14 pts), boolean chains 8, ternaries 2 (4 pts) (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":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"c470c87b686f5311cd5f005dfc322fc8e3ddee9aa2c50cf1cb17c1603f7b1cb4"}},{"ruleId":"D2","level":"warning","message":{"text":"store.scanLearnSessionMetricsUntil (cognitive 45): store.scanLearnSessionMetricsUntil has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 10, loops 3 (5 pts) (nesting depth added 19). Most of this is not in the body itself: 13 of the 45 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 161, 153). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e2e4e497d8c50e4a0a446bc4069ac6f700f4cbae188925ee87fa17129b4e98"}},{"ruleId":"D2","level":"warning","message":{"text":"store.retroStreamCutTokens (cognitive 45): store.retroStreamCutTokens has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 7 (10 pts), boolean chains 9 (nesting depth added 16). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"937f2e5aa44e327847dae03a1a378259b4be24dcbe0883fb5cab72bf7341e49e"}},{"ruleId":"D2","level":"warning","message":{"text":"owned-install.uninstallOwned (cognitive 45): owned-install.uninstallOwned has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 6, ternaries 3 (6 pts), error handling 1 (3 pts), loops 2 (3 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":"installer/lib/owned-install.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"961f89c3630f7a7603cf209adf39fa844be145308b45463c1832e9f762c5ebb8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hermesRestoreOwnedByValue (cognitive 45): index.hermesRestoreOwnedByValue has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 5 (8 pts), ternaries 2, boolean chains 1 (nesting depth added 18). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869488473ffa831b988fa8a15a390132e1097dd74d05684f3fe6c158f59286d"}},{"ruleId":"D2","level":"warning","message":{"text":"native-hook-fast.main (cognitive 45): native-hook-fast.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 18, ternaries 7, error handling 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"580cc036aea2605825bd691a0b5a3cfba8a4b1811a4fa6d14685721c07ec1012"}},{"ruleId":"D2","level":"warning","message":{"text":"measureHarness (cognitive 45): measureHarness has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 9 (11 pts), boolean chains 7, other 7, error handling 2 (4 pts), loops 3 (nesting depth added 8). Of this number, 34 points are the body\u0027s own statements and 11 belong to 12 function items inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"91238a6dbf21b16f0398afdb3ad7555e61b3a5b5dac947f85f3bf906c9b0b565"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.readJSONTOONValue (cognitive 44): compressors.readJSONTOONValue has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 28). 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":"engine/compressors/toon_encode.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8abcb3fbf947df5e6a3ec5455200116ee18af06bea34f86e88f0a4e45dc6a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runServe (cognitive 44): main.runServe has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 6, loops 3, match/switch 2 (nesting depth added 5). Of this number, 39 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9db199d73ee7fc09853fbe4f3555273e370e08e6134f6ae73d676c8acdefc0"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.appendChatMessage (cognitive 44): translate.appendChatMessage has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 6, loops 2 (5 pts), match/switch 2 (nesting depth added 16). Of this number, 19 points are the body\u0027s own statements and 25 belong to 2 function literals inside it that branch. 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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaa3a732a69a8121b98d8355e7196cfd51a55d8c6fd197b265e96ecc34e4178"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hermesFlowSequenceItems (cognitive 44): index.hermesFlowSequenceItems has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 10, loops 2 (4 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":"packages/cli/src/index.ts"},"region":{"startLine":19026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2a4b9b6182a055b755f02ae19ea6b20a7476e1bf75b58e99fbc08618479521"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.parsePytestJSON (cognitive 43): compressors.parsePytestJSON has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 3 (7 pts), boolean chains 2, 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":"engine/compressors/testreport.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c934bb61eb82e1c6c308c470c060b735c48bc13502c104191332961184d78fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"middleware.caseFolded (cognitive 43): middleware.caseFolded has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 6 (13 pts), boolean chains 1, match/switch 1 (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":"proxy/internal/middleware/presence.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17d8f85a5e938a6eacc71005c58a6133f2b73c26083086650ee887b6f303ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"run.main (cognitive 43): run.main has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 8 (12 pts), loops 7 (10 pts), boolean chains 6 (nesting depth added 16). Of this number, 41 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035762205a7cd04b4433d0f34dbab03253f40fc3467877286af0548844bfdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"parseArgs (cognitive 43): parseArgs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 6, ternaries 2 (6 pts), loops 2 (3 pts), match/switch 1 (2 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":"installer/install.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64a599bf6b870f8ac46cbb597fcaaddbe5e99141fc13691c028e2c510358294"}},{"ruleId":"D2","level":"warning","message":{"text":"tabularCompressor.compress (cognitive 42): tabularCompressor.compress has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 7 (8 pts), boolean chains 2 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/tabular.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"60762ce2ef020e3cea65973c9e08bdc1ac8fc6638d3d9dc38d6a5714e58bff10"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.parseRetrieveCall (cognitive 42): gateway.parseRetrieveCall has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 4 (8 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"801f28e92b43c4c52480d87dfe48cca44dbd6be97f8786d073006bcead2bc9a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.retrieve (cognitive 42): Runtime.retrieve has cognitive complexity 42 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 8, loops 1 (nesting depth added 7). Of this number, 35 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"proxy/internal/middleware/recovery.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5765ae1dc6fda7a7bf7411b2323c351aba24442462a5351425a58abcf4b2ac8a"}},{"ruleId":"D2","level":"warning","message":{"text":"requestScan.str (cognitive 42): requestScan.str has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (10 pts), boolean chains 9, loops 3 (7 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":"proxy/providers/inspect.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2bdc71f952a63f1df781660611d20a7cb5a4819c9125986f1a65fddd1639ca"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanModel._project (cognitive 42): CavemanModel._project has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 7 (10 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 12). 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":"packages/middleware/python/caveman_middleware/strands.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d724d65036ab6098215ad6414399b8bac931a087d3168a0cfb739c91f986606"}},{"ruleId":"D2","level":"warning","message":{"text":"index.yamlScalarAfterKey (cognitive 42): index.yamlScalarAfterKey has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 6, loops 3 (5 pts), ternaries 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":"packages/cli/src/index.ts"},"region":{"startLine":14357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70008db55f221b5a0436c77ca1a2d2c9abbfafa503fcf51d6896399a3dc59f9"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.parseTOONObject (cognitive 41): compressors.parseTOONObject has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 4, 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":"engine/compressors/toon_decode.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca8bb3cd1b7a0e017263fb5c3ec5431bedbb52e58b4e5f7e2f66fdf21e1802"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.decide (cognitive 41): Link.decide has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 11 (nesting depth added 9). Of this number, 29 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. 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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"505bc426e4c35232ca76b8173b60c6480b551f9e35c49c548b1211cf4f77e7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.runRetrieveLoop (cognitive 41): Server.runRetrieveLoop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (40 pts), 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"36415261d1f33611479e9f9df6bd513ce4c4040c0a0ac32de0de60defd19036a"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.treeAt (cognitive 41): translate.treeAt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (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":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fde1f5172376f33662c5b0eeb2b73c1f1453381b32c9d306f87bf66bff42db"}},{"ruleId":"D2","level":"warning","message":{"text":"pruneOrphanedManagedHooks (cognitive 41): pruneOrphanedManagedHooks has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 13, loops 2 (3 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 19 belong to 3 function items inside it that branch. 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":"installer/lib/settings.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"749d379cfab7932c2ab481d982291ffe5a1bc8e4625d96102e8d8fefc160518a"}},{"ruleId":"D2","level":"warning","message":{"text":"store.comparableConfigTokens (cognitive 40): store.comparableConfigTokens has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 22). 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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba9c612eea77a4cce98b1c7e97ae12a503ee6ce907d9c2db805272adeddcfd0"}},{"ruleId":"D2","level":"warning","message":{"text":"store.buildLearnTrends (cognitive 40): store.buildLearnTrends has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 6 (8 pts), boolean chains 4 (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":"proxy/internal/store/learn_trends.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c14d113ca816fe70953934b4ff24f2d7e8148a23f9ba24e8e38e8ded5a6b8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"opencodeSessionSource.scanSession (cognitive 40): opencodeSessionSource.scanSession has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 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":"proxy/internal/store/source_opencode.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7788db5812e61483b01668cec077a2b9cdef4dc4c934b2c4e5dceecbad7e41"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.#optimize (cognitive 40): MiddlewareRuntime.#optimize has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 8, ternaries 4 (7 pts), loops 2 (nesting depth added 9). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadf0a43bf50de1512baa672c0051ad0baa2ee3821bd5b6e949beb4954fa10d7"}},{"ruleId":"D2","level":"warning","message":{"text":"store.sanitizeRequestRecord (cognitive 39): store.sanitizeRequestRecord has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, boolean chains 12, match/switch 2. 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":"proxy/internal/store/store.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5804dd94d1b9aa4b434081986d2dd7258901dfe3d30316f81c17d7c75a6029f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Base.SanitizeAndMapHeaders (cognitive 39): Base.SanitizeAndMapHeaders has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 1, loops 1, match/switch 1 (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":"proxy/providers/adapter.go"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecb440ee40a6ef5e089af92c3c2adf7ad4b3b36b03a294ce59f09ebe36b9d58"}},{"ruleId":"D2","level":"warning","message":{"text":"compress._compress_file_locked (cognitive 39): compress._compress_file_locked has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 3 (6 pts), error handling 3 (5 pts), boolean chains 3 (nesting depth added 11). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267ac01ca034a8916cb9b07d296a744f988aa975213b4d43cc29be35de6c752"}},{"ruleId":"D2","level":"warning","message":{"text":"compress._compress_file_locked (cognitive 39): compress._compress_file_locked has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 3 (6 pts), error handling 3 (5 pts), boolean chains 3 (nesting depth added 11). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf49f73d76e668181674fbaa769bc41254b20be967e9806bca8537983b14664"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.inactiveReason (cognitive 39): apply.inactiveReason has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 4 (8 pts), boolean chains 6, loops 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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ba65fa3da31312037b3446e517935bfe38453455e8ec31732b9c7b89f4cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.formatSessionSavings (cognitive 39): index.formatSessionSavings has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 13 (16 pts), if/else 12 (13 pts), boolean chains 10 (nesting depth added 4). Of this number, 37 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6beb173de3b62f87fd280833965c6590a2089bffa1c20f314793d9a9fa9ef854"}},{"ruleId":"D2","level":"warning","message":{"text":"index.claudeProfileMutations (cognitive 39): index.claudeProfileMutations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 10, ternaries 6 (7 pts), loops 3 (4 pts), error handling 1 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8930}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab274712e58584984661475cbecf3305153fb718d06386597eb4f039d6c0336"}},{"ruleId":"D2","level":"warning","message":{"text":"Creds.Resolve (cognitive 38): Creds.Resolve has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 7, match/switch 1 (nesting depth added 12). 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":"proxy/internal/standalone/standalone.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bf6736cad38bc36f11436fff102be2b45dd8ed9985a686fa74a3fa65857304"}},{"ruleId":"D2","level":"warning","message":{"text":"store.retroSessionPathsUntil (cognitive 38): store.retroSessionPathsUntil has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 14). Of this number, 16 points are the body\u0027s own statements and 22 belong to 4 function literals inside it that branch. 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":"proxy/internal/store/learn_retro.go"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5135619dcebaf5a3e309649e6ba82f74c8e8bf26993a3362bbf20b63a26a39"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.extract_indented_code_blocks (cognitive 38): validate.extract_indented_code_blocks has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (10 pts), boolean chains 4 (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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48ad9312f11ce061a7e719d5318e9f7a206c79313ed6c9efdadb1acbda99685"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.extract_indented_code_blocks (cognitive 38): validate.extract_indented_code_blocks has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (10 pts), boolean chains 4 (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":"skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0ecd687aa398cbe217a89188c89c58e69624be5ded1b9fd0e1e028118cd9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"version.cmpVersion (cognitive 38): version.cmpVersion has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 5 (15 pts), boolean chains 3, loops 2 (nesting depth added 17). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/version.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"382760e4b6d064933c778488b362f9970980acf3079b8207dd2de425ae31292f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.login (cognitive 38): index.login has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 15, if/else 11, ternaries 9 (11 pts), error handling 1 (nesting depth added 2). 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":"packages/cli/src/index.ts"},"region":{"startLine":12881}}}],"partialFingerprints":{"codehealthFindingId/v1":"304642d3fc2432866f4ed1c41335e8b6e7a6dbc17a75ebc87a0a98cf3f67ec94"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hermesPluginListContains (cognitive 38): index.hermesPluginListContains has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 6, loops 3 (6 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":"packages/cli/src/index.ts"},"region":{"startLine":19092}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a80f004cde242a9f16b9d518a1d278be78db561206437eff3db6ff0cb91173d"}},{"ruleId":"D2","level":"warning","message":{"text":"middleware.New (cognitive 37): middleware.New has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 6, loops 2 (nesting depth added 4). Of this number, 34 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/runtime.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3125b01f6b690cc0f57b18f1474a5a41a2e32edd014350dccb0f4cd756395d55"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.DecodeAndValidate (cognitive 37): catalog.DecodeAndValidate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 4, loops 2 (3 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":"shared/platform/catalog/catalog.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4934271baf5796beaf548e71e90d70c7a37818c11ba08cadd48aeb3f1657a3f6"}},{"ruleId":"D2","level":"warning","message":{"text":"google.delegatedClient (cognitive 37): google.delegatedClient has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 7 (12 pts), error handling 3 (6 pts), boolean chains 4 (nesting depth added 17). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 165, 175, 156, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a125b1b43d496228b18554a246c6cdc688ee9400a54def49f993c42592c69cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.collectOpenAIChatPixelLiveZone (cognitive 36): gateway.collectOpenAIChatPixelLiveZone has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (2 pts) (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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c129dcffeba848150a482225bb7c0284815eb4f08b7e74871eba29b77b9d487c"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.newRouteRun (cognitive 36): gateway.newRouteRun has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 9, match/switch 4 (8 pts), loops 2 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997a11738fb6917a47674f56243eab24c2648177a2073500a2a1a0ff2e55b50"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_catalog.validate_row (cognitive 36): validate_catalog.validate_row has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 8, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/provider-catalog/validate_catalog.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b719e265812737a4593ad89ee4918fd30ab75f27c645636170da2c460ea5b4"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.stripJsonComments (cognitive 36): settings.stripJsonComments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 18). 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":"installer/lib/settings.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36edaef1c176fd936dba0ae20039f20a1416fcee6b8ae42ad1b29c7db3fde9"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-mcp.validateTraceFilters (cognitive 36): agent-mcp.validateTraceFilters has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 11, loops 3 (nesting depth added 9). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0749d360f718a2d274786188bdc4613910736978d77f242f945c92cfcdc52781"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.choose (cognitive 36): onboard.choose has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 10 (16 pts), if/else 9 (10 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 8). None of this is in the body itself: all 36 points belong to 7 function items inside it that branch (a function literal at line 803, render, gaveWay, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91714585ae50eef9a72e302dcce968a56e3ddd8a43295daf580a2a58e66b9c7"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-routing.verifiedProviderRoute (cognitive 36): provider-routing.verifiedProviderRoute has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 7 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/provider-routing.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35d2145903d5beec5fc6d2530665945efe39a339dce127fb630388db1e73dea"}},{"ruleId":"D2","level":"warning","message":{"text":"index.learnSummaryMoves (cognitive 36): index.learnSummaryMoves has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 9 (24 pts), if/else 6 (11 pts), loops 1 (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":"packages/cli/src/index.ts"},"region":{"startLine":20103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4849206a72af168b67c31b2dc3c581f851b4bef35a6bdafdac4ae8a7c3f001c8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.mem (cognitive 36): index.mem has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 17). 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":"packages/cli/src/index.ts"},"region":{"startLine":21064}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7dd48deacfae5d4910c28500f18a581ef8f877458478a94e82abc7ecba048b"}},{"ruleId":"D2","level":"warning","message":{"text":"verbs-gate.scanSkillBody (cognitive 36): verbs-gate.scanSkillBody has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 7, loops 3 (nesting depth added 12). 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":"skills/verbs-gate.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8011e534ca276acae5be170860eac38167805a753bdfa16af28c58bba902f9"}},{"ruleId":"D2","level":"warning","message":{"text":"attributeByMode (cognitive 36): attributeByMode has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 8). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca23cfc88b198ec701adabc6b34edae9a22abb99010a01dd2371d9e8dff4855f"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.parseJestJSON (cognitive 35): compressors.parseJestJSON has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (8 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":"engine/compressors/testreport.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353ff606fd37414f07532abfce188cea365d4ed4596d139747434f6abe2cc09"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.stripToolSchema (cognitive 35): Server.stripToolSchema has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 6 (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":"proxy/internal/gateway/toolschema_strip.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"108257d572ba850e53ade297b09000071202bcc4b8bb11a887ffb4c7f83b3e12"}},{"ruleId":"D2","level":"warning","message":{"text":"store.outcomeSink (cognitive 35): store.outcomeSink has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 12). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_outcomes.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc246a059b37984734f9381c50ed97d84d6ecfe06bf95f715783af6157260845"}},{"ruleId":"D2","level":"warning","message":{"text":"store.AttachLearnTrendHistory (cognitive 35): store.AttachLearnTrendHistory has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 9 (10 pts), boolean chains 4 (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":"proxy/internal/store/learn_trends.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01548d0eaefae3617ccba8805a206c886b2383a0495b02cd32cd64f1aacbabf"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.report (cognitive 35): MiddlewareRuntime.report has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 17, boolean chains 11, if/else 4 (5 pts), error handling 1 (2 pts) (nesting depth added 2). 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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c654a895fb131975c9a263109d6a5e67c8a42f42461843691b7b07aaefdc91"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hookCommandTokens (cognitive 35): index.hookCommandTokens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 12). 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":"packages/cli/src/index.ts"},"region":{"startLine":7996}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3743e74eeda8366dbff8baf57a703976ada0a0eeb52e761a886e7d1fc26d76c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenControlSurfaceOverride (cognitive 35): index.qwenControlSurfaceOverride has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, loops 3, ternaries 1 (2 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":16021}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a9425fa9f1c8819a07ae77d6cfe84e1a02424b8ce86ec58ce772c54add652d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.transactOwnedMcpConfig (cognitive 35): index.transactOwnedMcpConfig has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 5 (7 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16661}}}],"partialFingerprints":{"codehealthFindingId/v1":"289224f05b169d10abc71f81cc6ea72cd1c96580376e50e0575a332cb0f2420b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderLearnSavings (cognitive 35): index.renderLearnSavings has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 7 (20 pts), loops 6 (10 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 18). 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":"packages/cli/src/index.ts"},"region":{"startLine":20606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71f2468800f0e920b26e83f57a854180b9e64fbfb076f049022f978ce2a1091"}},{"ruleId":"D2","level":"warning","message":{"text":"index.usage (cognitive 35): index.usage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21176}}}],"partialFingerprints":{"codehealthFindingId/v1":"37480a46e5741c543f42064e22f1d7b638dbfe329bc9526bd2aba8ad77893586"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.toRow (cognitive 35): ingest.toRow has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 23, if/else 9, ternaries 2, loops 1. Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/ingest.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36a711aa4ea55d7538603183671b1ff5ee5abf945fe1b2f91bd1cd127a36e10"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstallOpenclaw (cognitive 35): uninstallOpenclaw has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (6 pts), boolean chains 5, error handling 2 (3 pts) (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":"installer/lib/openclaw.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf5fe0c40e0fd782fe4ffe2e785dc6c34d4aeb33ebd9a22945354db6b5c1409"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.expireBatch (cognitive 34): Store.expireBatch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_reclaim.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2930a505705fdbb9338bc92682a920255a30b9d3e07ae70bcb9f68871026b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.parseTOONArray (cognitive 34): compressors.parseTOONArray has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (6 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":"engine/compressors/toon_decode.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b58381c30e9b56a53a4d675677d4a3317884d1a2b65044f9a124a020a970776"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.buildLearnPlan (cognitive 34): Store.buildLearnPlan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27 (28 pts), boolean chains 4, loops 2 (nesting depth added 1). 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":"proxy/internal/store/learn.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d003f63aaebc9fab4ce7063789cdba90b278c35bc6fdceede1cbb3c47d2f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.sseLines (cognitive 34): translate.sseLines has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 18). None of this is in the body itself: all 34 points belong to 3 function literals inside it that branch (lines 101, 78, 143). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe75904ef91fb0e92d1b34ee1b1201b7a52ef6b68ecaae65852c9f16da9cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.estimateInputTokens (cognitive 34): translate.estimateInputTokens has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (10 pts), boolean chains 2, 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":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45f94a9683e964da15a2ae2815d131e5e56da0078b8675d752237212ca8c83b"}},{"ruleId":"D2","level":"warning","message":{"text":"status.renderModuleGrid (cognitive 34): status.renderModuleGrid has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (31 pts), boolean chains 1, if/else 1, loops 1 (nesting depth added 22). Of this number, 22 points are the body\u0027s own statements and 12 belong to one function literal inside it that branches. 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":"packages/cli/src/modules/status.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"df133283de439575b620c22986cbfc77de00660234e6ae54e0fa43a22db5b6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"index.restoreNativeJournalFiles (cognitive 34): index.restoreNativeJournalFiles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (7 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 17). Of this number, 30 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11442}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d1eaf8f23319bf81790e3be0db25ae97f680a3d31154a7d85c055720a1a7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderStatus (cognitive 34): index.renderStatus has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 11 (13 pts), boolean chains 4 (nesting depth added 12). 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":"packages/cli/src/index.ts"},"region":{"startLine":21715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a87da3a003a6ccafebd76683fb3247ddd7f80d9296348af7c138963a17030"}},{"ruleId":"D2","level":"warning","message":{"text":"mastra.withCavemanMastra (cognitive 34): mastra.withCavemanMastra has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 7 (12 pts), boolean chains 5 (nesting depth added 12). Most of this is not in the body itself: 11 of the 34 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 118, protection, a function literal at line 108, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd776fee8bc2040dc7aa588b9a168c04305e890eeeff4bf0664ae3223f9c765c"}},{"ruleId":"D2","level":"warning","message":{"text":"mastra.createProcessor (cognitive 34): mastra.createProcessor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 6 (10 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. 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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b0fd9ac779858f771546131e727ef3a6fa37d11da3c8c5dcfe157d288eef39"}},{"ruleId":"D2","level":"warning","message":{"text":"parseSession (cognitive 34): parseSession has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 4 (10 pts), boolean chains 6, 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/hooks/caveman-stats.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fff284fab1e79536cb34ca55eb85a5098e82eb16f702168f9e4a5cf7938f66d"}},{"ruleId":"D2","level":"warning","message":{"text":"CDPDriver.waitActionable (cognitive 33): CDPDriver.waitActionable has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (22 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (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":"browse/cdp.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db93049bc26606f50d17691782374588e703a261b355f3f922dcf8bf824fb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runPixelRender (cognitive 33): main.runPixelRender has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (3 pts), loops 2, boolean chains 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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a59cc965d5aa598a91ddb1d783f19acb7a0d2c249e8610243bb675dfda6db4"}},{"ruleId":"D2","level":"warning","message":{"text":"google._prepare (cognitive 33): google._prepare has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 14, ternaries 2 (4 pts), error handling 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676a8f625484931f4516ca3716950cdc0afa2ec322ddaecc5447b75f33cca62"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.toggle (cognitive 33): onboard.toggle has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 10 (12 pts), boolean chains 6, loops 1 (nesting depth added 7). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 8 function items inside it that branch (render, a function literal at line 725, a function literal at line 695, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2d515a5a7dfb3442d2062dee385c331857e2e510279ba7dbcaa3844a5a88aa"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hermesNativeConfig (cognitive 33): index.hermesNativeConfig has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (5 pts), ternaries 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10374}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe86f31cbe328316c165863e7e732d38d7dee33b36074ba31b0f68466e9d0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.collectOpenAIResponsesPixelLiveZone (cognitive 32): gateway.collectOpenAIResponsesPixelLiveZone has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f325cd71a6a920c855c75ac1ecacf44eff8fc872d4f434a021e08c10a17451"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.record (cognitive 32): Server.record has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 7). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b416e1ae4b00155051ea57451074d2930018de81ab21c1c2c06df6d7cb7c22e4"}},{"ruleId":"D2","level":"warning","message":{"text":"middleware.previousPlan (cognitive 32): middleware.previousPlan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). 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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f03545b92cf79c0b2425c442987ef2774168bd2c51dd5b876f217d0d661cdb3"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.messagesToResponses (cognitive 32): translate.messagesToResponses has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 2 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 719). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"903c267c9ddb03514d1fca2844989ada526050386b45f923c3d69f3a6c5d5692"}},{"ruleId":"D2","level":"warning","message":{"text":"llama_index._message_view (cognitive 32): llama_index._message_view has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), ternaries 2 (6 pts), boolean chains 3, error handling 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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b410f2e743308c17a088190bf337d9cd4d7ad9dce9cd748a33bb3c61bc419f64"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-extension-stage.verifyExtensionRoot (cognitive 32): verify-extension-stage.verifyExtensionRoot has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (8 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/verify-extension-stage.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa02933616271f06f59c50348b6e9b69bbddf37950292b824c85cea71f505ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"command-args.parseCommandArgs (cognitive 32): command-args.parseCommandArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/command-args.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4716063aa565aa3ada3a28a9dbc1899b2f249b3812d0b9d308ce82834fbae5b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.hooksDirectiveCmd (cognitive 32): index.hooksDirectiveCmd has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 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":"packages/cli/src/index.ts"},"region":{"startLine":19417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6ea29b370a629e991c25c7a845cd1e95282d0b8036e4ff690cc3ec1e6b6bec"}},{"ruleId":"D2","level":"warning","message":{"text":"langchain-model.prepareLangChain (cognitive 32): langchain-model.prepareLangChain has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3 (5 pts), boolean chains 4, ternaries 3 (nesting depth added 8). Most of this is not in the body itself: 4 of the 32 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 67, 72, 80, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"531df640721d540dc468eea2191b621fb739d226d4aaa675f5a0661de6ff2e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.default (cognitive 32): index.default has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 9, error handling 3, ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 2 of the 32 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 178, a function literal at line 234, a function literal at line 269, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae611c54eab0ffb3fbb14d1f5836045c9a850f4cb5f2c1246103235baa7a36a"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.parseJUnitXML (cognitive 31): compressors.parseJUnitXML has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 17). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/testreport.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9df920cc16c522b28f0da7de900209acadd78b1509082e85865df08c7cdb454"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.appendRetrieveResult (cognitive 31): gateway.appendRetrieveResult has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf885215f0f93c4c67b8002467089dae61fa43bd969b970416720a389ab5afd"}},{"ruleId":"D2","level":"warning","message":{"text":"postgresMiddlewareTx.ExpireBatch (cognitive 31): postgresMiddlewareTx.ExpireBatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 3 (4 pts) (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":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b68c318c350d23f86d7702591c336a5314b972affe1ab0cf30a9f0b303fd83"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot_contract.validate_snapshot (cognitive 31): snapshot_contract.validate_snapshot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 5, loops 3 (4 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":"evals/snapshot_contract.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17cfd40aebda0bf1ddcf7525562d6cc5eb8bc3cdcdbaaa08791042413ac194"}},{"ruleId":"D2","level":"warning","message":{"text":"openclaw.installOpenclaw (cognitive 31): openclaw.installOpenclaw has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), error handling 4 (7 pts), boolean chains 3, ternaries 1 (2 pts) (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":"installer/lib/openclaw.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544e7996532b9ddd50d5a0498d4d2121eecbc076054a0ac098b8ef4407987ef"}},{"ruleId":"D2","level":"warning","message":{"text":"stats-cli.renderStatsSummary (cognitive 31): stats-cli.renderStatsSummary has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 6 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/stats-cli.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa754e175535919bce4b2975750502907e389e35658fe57a20f36b44861e465"}},{"ruleId":"D2","level":"warning","message":{"text":"index.stripJson5Comments (cognitive 31): index.stripJson5Comments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 pts), boolean chains 5 (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":"packages/cli/src/index.ts"},"region":{"startLine":7342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6844dad2e5542a26e1e1035e65413a02f44892d135f01d19c50b08131e89ecd7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncLocalSavings (cognitive 31): index.syncLocalSavings has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 6 (9 pts), boolean chains 5, error handling 3, loops 2 (3 pts) (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 11 belong to 6 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":13525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097a08f155e57ea2c50108f821f31c865f0d2e1fa38c2a99de81164e88faf6d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenArgsPermitRecovery (cognitive 31): index.qwenArgsPermitRecovery has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (6 pts), boolean chains 4 (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":"packages/cli/src/index.ts"},"region":{"startLine":16305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b146b9f0c24871adfa6b49c600fef4c4ba8c2928b2116e56b981a3f2d7648b4"}},{"ruleId":"D2","level":"warning","message":{"text":"formatStats (cognitive 31): formatStats has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 9, if/else 7 (9 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418d7ae1221c9f47148443bd063833d1a6f18c48710c72a32352344fa50188b"}},{"ruleId":"D2","level":"warning","message":{"text":"prefixMonitor.observe (cognitive 30): prefixMonitor.observe has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 12, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"138821452e2ad2e134736c9dd5b4b9c39d61a79e170a574e5c8c07a51d14ffac"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.ensureTaskContract (cognitive 30): Runtime.ensureTaskContract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, loops 2 (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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c827ec743aeccdb111426f70a09ef5d2115a51107831c49f2c8607558c352513"}},{"ruleId":"D2","level":"warning","message":{"text":"store.measureAppliedFix (cognitive 30): store.measureAppliedFix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (5 pts), match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c60d86f67094a69f386ebc4e9170e1a1fe1646df7d091781fc6ff2b70c26ba"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanLLM._options (cognitive 30): CavemanLLM._options has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 4 (6 pts), boolean chains 5, error handling 1 (2 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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"90369990f7fdaef1543cd4a890c253c55d6cffe2962c32eab19cd4cc90008a77"}},{"ruleId":"D2","level":"warning","message":{"text":"_ContextPacking.pack (cognitive 30): _ContextPacking.pack has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 5 (6 pts), error handling 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f500f9012d52850d7b765ceaed4e2abaf47a17092d903e3d0e9310bc0c72a3"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.detect_file_type (cognitive 30): detect.detect_file_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts) (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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1060c1aa89722cc500c9ac23dfa6b3656fee6a9134a1a3b315d244b210d85ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.detect_file_type (cognitive 30): detect.detect_file_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts) (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":"skills/caveman-compress/scripts/detect.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d0658d0c75b1f408ecc3059598c14fb810bf2691dfc1faffe639998ac30823"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-mcp.validateTraceSearch (cognitive 30): agent-mcp.validateTraceSearch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f9c5cbea3259a581f470212701a35f7b2ddd8f72f551d8fcd07a6280ce769"}},{"ruleId":"D2","level":"warning","message":{"text":"stats-cli.parseStatsOptions (cognitive 30): stats-cli.parseStatsOptions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/stats-cli.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"66952fc8e9718aa1fa1d9c10818431fa36c36ecf05479bad3397d99abe88ce7b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.setupInstallLocked (cognitive 30): index.setupInstallLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 5 (9 pts), boolean chains 2, loops 2 (nesting depth added 12). 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":"packages/cli/src/index.ts"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf280d4048012c40d24729c827994c497470d31cd21f1f5b67e74f251e1d81a"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-config.appendFlag (cognitive 30): caveman-config.appendFlag has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 5 (7 pts), ternaries 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/hooks/caveman-config.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a427a9f85b3d6c40adac656a1a1ccdc1710579361e35ae0d75906dda171cecac"}},{"ruleId":"D2","level":"warning","message":{"text":"CDPDriver.Act (cognitive 29): CDPDriver.Act has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 1 (nesting depth added 14). 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":"browse/cdp.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90141912d20b19671086d1e7231ed1a21a3158551be5d67ef8e034e0e23643b"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.curateAXTree (cognitive 29): compressors.curateAXTree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 8 (11 pts), boolean chains 3 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d98cd12ccb538b7157ad2d1a4dc00d3a893070faa7415c3a50e96e0f79380"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.expandYAMLContext (cognitive 29): compressors.expandYAMLContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (9 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":"engine/compressors/config.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc24ef26cc5cc7ad795b9b8d2f2d88bee8dae096e28559d079af9f109d4861"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.anomalyIndices (cognitive 29): compressors.anomalyIndices has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (13 pts), boolean chains 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":"engine/compressors/json.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d5628d4f399cf7169b3fa1ad8987e0cb8e980e9c1b787d22f3be32b74880de"}},{"ruleId":"D2","level":"warning","message":{"text":"annotationStripper.walkObject (cognitive 29): annotationStripper.walkObject has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e094974c38601189ef6e7b21149ef6320076a9c96fa92860cb534d57076872e"}},{"ruleId":"D2","level":"warning","message":{"text":"cloudlink.askTextFor (cognitive 29): cloudlink.askTextFor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, match/switch 2 (4 pts), loops 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaed87770676fdd26146b0ad89ce199159fd971fec012d01bef916073c6767ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.armCacheWarm (cognitive 29): Server.armCacheWarm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (6 pts), boolean chains 3 (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":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f3a63dc35b9f075d8eef905ecb8920439062063771fbe95b6a9d06627bb089"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.validate (cognitive 29): Runtime.validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 9, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/validate.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da4b8361a1affe47afe136d13933dd3ccb532d7e2dcd179f09c49e1cf5218f4"}},{"ruleId":"D2","level":"warning","message":{"text":"store.duplicateRulesSink (cognitive 29): store.duplicateRulesSink has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (4 pts), boolean chains 2 (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":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e944c5140102e9a59d5300a31ffb0436e9e42418e0ddc4b8187844cde6f4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.responsesMessagesBody (cognitive 29): translate.responsesMessagesBody has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (5 pts), match/switch 1 (2 pts) (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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c32d2c76dc3be8bc056a4a042868524dbb4934fcd28652c29787365123b1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.ResolveUpstreamURL (cognitive 29): Adapter.ResolveUpstreamURL has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/routing.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d166ac08ffa001efd7cc6757cdd7184f0e3cece6e2a50f5373897d4faae136"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.__init__ (cognitive 29): MiddlewareRuntime.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 12 (13 pts), boolean chains 7, if/else 5 (6 pts), error handling 2 (3 pts) (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce08ee15b683d4bba8b90e418599b0851d5d17967e628c699304b93f95e20604"}},{"ruleId":"D2","level":"warning","message":{"text":"release-smoke.main (cognitive 29): release-smoke.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, error handling 2 (3 pts), ternaries 3, loops 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".blocks/release-smoke.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bc31d0efac29bfba3103bde566fd79c26f801e10626a920e26fcc3d5f46c74"}},{"ruleId":"D2","level":"warning","message":{"text":"install.inspectOmpRegistration (cognitive 29): install.inspectOmpRegistration has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, error handling 3 (6 pts) (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f64b5eaeb76815aea52da9dde89b3d2eb1f49415fcfca0e4988a240c06ce614"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeHooksDocument (cognitive 29): index.nativeHooksDocument has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 5 (8 pts), boolean chains 5, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0905efd08454baf47632b8e73d7ac9e53cad6a8dcf09694fe6a8ac58e5e3b558"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.#exchange (cognitive 29): MiddlewareRuntime.#exchange has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (5 pts), boolean chains 4, loops 2 (3 pts), error handling 2 (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"82154dd1d1640a84d96ec0305a0faa4279e7b18170c9cd682309b2b7c5142b53"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-stats.findRecentSession (cognitive 29): caveman-stats.findRecentSession has cognitive complexity 29 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5 (9 pts), loops 4 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeef565cdff6d86126968e1b74dcfbc0f3515dbfb402a3089255c50a8113cafa"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.openWithBudgetHooks (cognitive 28): ccr.openWithBudgetHooks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 3, loops 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"eead4dd4f4846ad37564e3f04a9de553650e6632f90f90e31e7caa32f42584d2"}},{"ruleId":"D2","level":"warning","message":{"text":"contextwindow.Pack (cognitive 28): contextwindow.Pack has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 4, boolean chains 1 (nesting depth added 8). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/contextwindow/contextwindow.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd774118afe22f06c15a30b760b06085ad10b74687c6518d45d69a65c58ceb3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runUsage (cognitive 28): main.runUsage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 4 (7 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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0a57704e0ea1775b422a85eee494e7e48df00163b42980fbbf4efb2e1964f0"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.gatewayScanJSONValue (cognitive 28): gateway.gatewayScanJSONValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 18). 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d630420a43cd3a9a34cf1bc8bb7f75282b151f9f245ac27fdadd6b942215a2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"store.retroRepeatedStreamCandidates (cognitive 28): store.retroRepeatedStreamCandidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"43728dd3e3fc157c42be634d67122e58948d21ce6bef289fd49f9a76562eb43c"}},{"ruleId":"D2","level":"warning","message":{"text":"store.retroScanClaudeFile (cognitive 28): store.retroScanClaudeFile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1a69851cc4f74c0a826167ae5072fe236f9532218a905435b5cf85c5b6e4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.injectBreakpointRaw (cognitive 28): anthropic.injectBreakpointRaw has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), boolean chains 4, match/switch 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":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8bd0ac36fc48e7b252ac253d399b377898d86926b0474622ba49a754305ac"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.collectAnthropicBlocks (cognitive 28): anthropic.collectAnthropicBlocks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 pts), boolean chains 4, loops 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0e01af328cc5c19067dd8754c0e4f7765a770104cb6f801ef6a858fe5f4072"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.scanJSONValue (cognitive 28): anthropic.scanJSONValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 18). 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":"proxy/providers/anthropic/splice.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb60209e7866fd6fd31122b09eda7e3b7f634fc08081cf9b660388ac44951b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.SanitizeAndMapHeaders (cognitive 28): Adapter.SanitizeAndMapHeaders has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 3, loops 1 (nesting depth added 5). 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":"proxy/providers/bedrock/signing.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7fdf8e6453b31dad81ee081143a12f14116e0155027dd444b89aa470a4c0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.scanJSONValue (cognitive 28): openai.scanJSONValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 18). 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae51b42b9ff6a818657ec9f2a89c8d0e20ece1993678bb9120d8be51e73aab4e"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanChatCompletionClient._project (cognitive 28): CavemanChatCompletionClient._project has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 3 (4 pts), boolean chains 3, ternaries 2, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aadddc14731e324dd511a4b8908d04b697985ec595e1abfe8590eb8cdf18b8"}},{"ruleId":"D2","level":"warning","message":{"text":"google._selected (cognitive 28): google._selected has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (8 pts), boolean chains 5 (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":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5595d0c42a3435732b4aa746209ea31b6aa9e89fdb5d7c5a23fa2abac71c64a3"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicyClient._accept (cognitive 28): RuntimePolicyClient._accept has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a6b28f3346d4eccad293658d07d50fb583904cb7ecab6314ac90ad891a111"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicyClient._decide (cognitive 28): RuntimePolicyClient._decide has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 5, ternaries 3, loops 1 (nesting depth added 1). 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d09d0de4864e6f230099b57cb9edee034a22833ea6a3f468d445ad4a6ab43"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.resolve_proxy (cognitive 28): protocol.resolve_proxy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, ternaries 5 (8 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/protocol.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"432fc17e4977ea59dfd0b731c742f848761e4686484f7ce849aca88f18468fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.rewriteLegacyManagedHookCommands (cognitive 28): settings.rewriteLegacyManagedHookCommands has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 4 (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":"installer/lib/settings.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df451f2c06f2583d5b98c983054a8e9ddac349ff5822c147deeceb2c0ede016"}},{"ruleId":"D2","level":"warning","message":{"text":"index.importSkill (cognitive 28): index.importSkill has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3 (4 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3956a6ec0d1d4591447501d3b1b74efafba4684e63228f2b3a12ade13fcfc5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.opencodeNativeMutations (cognitive 28): index.opencodeNativeMutations has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (8 pts), ternaries 5 (7 pts), loops 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":"packages/cli/src/index.ts"},"region":{"startLine":9763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed44768b8320e7a6aacf36014908a436116a6c0d4f591ab1581e3f0add4724"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-config.safeDeleteFlag (cognitive 28): caveman-config.safeDeleteFlag has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 4 (6 pts) (nesting depth added 14). 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/hooks/caveman-config.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83bc9be543c64d1a9f69506e1471929fbff37eb8464db479eba0d8446a53419"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.putObjectOnce (cognitive 27): Store.putObjectOnce has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (27 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":"engine/ccr/store_sqlite.go"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebb339a4a60d2d4a06ad824d7a99dabb8e759784e9b84bb8961b119d1695ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runPixelSimulate (cognitive 27): main.runPixelSimulate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac4783e92d70318f1334b0364061832741bcdfbef46f445c4e54da9168b119"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.fallbackKey (cognitive 27): gateway.fallbackKey has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/auth_fallback.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"185d9e442f600503572a8ffb8256729df2c2b530c62ff4400686e7311c889785"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.recordChatGPT (cognitive 27): Server.recordChatGPT has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 6 (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5acf6f71d86aca66dd4cdea30263d724b226807a654cea00fd8a39607fa5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"middleware.requestPresence (cognitive 27): middleware.requestPresence has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (7 pts), boolean chains 2, match/switch 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":"proxy/internal/middleware/presence.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01d1631bd2cb2daca8358dffc0d060c49872823b77b8a0eab6c20d49411c400"}},{"ruleId":"D2","level":"warning","message":{"text":"nativepack.validate (cognitive 27): nativepack.validate has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 5 (11 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativepack/pack.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924022f03156027189d861f91a42b5a9923ec620d07aeddf3602b2e1c4bc6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.saveIf (cognitive 27): Store.saveIf has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/pool/pool.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495b855908d115fd4e46ec7a444bd96f0bc8185052cd424c99d8d93d7019d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"store.scanConfig (cognitive 27): store.scanConfig has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (4 pts) (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a143a5b7accc7ffc4aa7b9ca8f155e78c5c8f0107621579b1690decdcf9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"store.collectInstructionFiles (cognitive 27): store.collectInstructionFiles has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdd2b01e08f79d7dbc9a4d8cf439b012faeba56aaea45bd44fbdccd4c228ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.buildLearnRetro (cognitive 27): Store.buildLearnRetro has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9288ae87079ea124478233924bfb859ffe3738f849bb49afb9d63fc87992ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Reply.serve (cognitive 27): Reply.serve has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c5bc3a65aff513c3790a4761d033f84d38af89c52be5e241d89a05fb77ddf4"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanLLM._options (cognitive 27): CavemanLLM._options has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 8, if/else 7 (8 pts), loops 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/crewai.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b3c92ab6cafaa5fcc870b4b811a3cb53ebfeec61636e1680438c35b0c7756c"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot_contract.validate_usage (cognitive 27): snapshot_contract.validate_usage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/snapshot_contract.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"de256d9bbddad0c8046b45a73fdec0cde28a0e4373fc1613fee360b161f8a26c"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.stripTrailingCommas (cognitive 27): settings.stripTrailingCommas has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 2 (4 pts) (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":"installer/lib/settings.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe73ac5f5d076c855059202ae6892a3c28e5fcdc80b73e4426cf6d8bd2d610f"}},{"ruleId":"D2","level":"warning","message":{"text":"learn-trends.learnTrendTable (cognitive 27): learn-trends.learnTrendTable has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 7 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. 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":"packages/cli/src/learn-trends.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f82b0e602dea8336419da799e8ae61a40f9d4beaf60891e2f92a68d7555345"}},{"ruleId":"D2","level":"warning","message":{"text":"index.yamlScopedBaseUrl (cognitive 27): index.yamlScopedBaseUrl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee390eccf01903eb04b333f3246ecdf991b1c170c5c0b4e50e9ad393b5d9185"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenWorkspaceTrusted (cognitive 27): index.qwenWorkspaceTrusted has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (2 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":15520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f277b3579fe8bc4942770b6dbd7459052141c14b66b39e8af9d9a0e1e2556b"}},{"ruleId":"D2","level":"warning","message":{"text":"wire.parseWire::walk (cognitive 27): wire.parseWire::walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). 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":"packages/middleware/typescript/src/wire.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d59a4a001b55024507e26cad66f81ff7536c5654e27e5908a0b5101a0baa741"}},{"ruleId":"D2","level":"warning","message":{"text":"index.contextPack (cognitive 27): index.contextPack has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, loops 2, error handling 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"feeacbd2fcbf4918f8223063f15cd524167655fca828dda3e0117fbddb779f75"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.runManifestWithSystem (cognitive 26): evals.runManifestWithSystem has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/evals/harness.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb998aa479eebb854c37b33e17e4b21f1d966f3a996bfba0cdf290128edefd1"}},{"ruleId":"D2","level":"warning","message":{"text":"oidcVerifier.verify (cognitive 26): oidcVerifier.verify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, match/switch 2 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/oidc.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a29979b610ce08ae33a160a4cbb99db14d24243c77a5ac4f8d6d42b5fa82739"}},{"ruleId":"D2","level":"warning","message":{"text":"repointel.buildBundle (cognitive 26): repointel.buildBundle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b40004d68ff07ae98ac985cffd1339a6d2e2248323a1425dd2c8aec141fd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"store.sanitizeStatsMeasurement (cognitive 26): store.sanitizeStatsMeasurement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 7, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/stats.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05921cfd750f1d032f11a71304d37136a47f1bf04fe2ce1582f273ba3fb769a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.BuildTrialPlan (cognitive 26): Store.BuildTrialPlan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 5, loops 3 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/trial_store.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9127ffee2c61002863cbe765da65f0d396379d269423178d76755480607da2"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.valueEnd (cognitive 26): translate.valueEnd has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 12). 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":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d03ec815279c854e0548b26c75dfb83b2214b856e1d081aa4650f786a2b39a"}},{"ruleId":"D2","level":"warning","message":{"text":"msgBuilder.assemble (cognitive 26): msgBuilder.assemble has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 12). 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":"proxy/internal/translate/msgbuild.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7d33333618a889b6252b6040e5ab4860ca69cd1c817a7647059f863778dd74"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.contentBlocksCarryBreakpoint (cognitive 26): anthropic.contentBlocksCarryBreakpoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/breakpoint_plan.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafbd8fa580fd0430bcd79720194dd8b16f47a3a7dcfbdab5fe2f003c564480b"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.parseBedrockText (cognitive 26): bedrock.parseBedrockText has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d21937e27bd64bca84aab3561f37a7887468ea5c67262b61e49ba3149b1620"}},{"ruleId":"D2","level":"warning","message":{"text":"ssrf.checkAddr (cognitive 26): ssrf.checkAddr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 3, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198d79df4d373e720bb86fd5449b3955576d27dd9d4033f8cb80086f659600d"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.plan (cognitive 26): validate.plan has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (11 pts), loops 2, error handling 1, ternaries 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":"packages/sdk/python/caveman_cloud/middleware/validate.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e2b1772be2d85b38f02e17ed78f6fde003630fbf92f524e02d09857165b289"}},{"ruleId":"D2","level":"warning","message":{"text":"llm_run.main (cognitive 26): llm_run.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 4 (5 pts), boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/llm_run.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0428b310901e366987b149a2aefc7e87bc66f9b32ac2ab259b3f550e6a7837a"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.moduleSwitchCommand (cognitive 26): apply.moduleSwitchCommand has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 7 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0a0efdf3c899c23fbe32d6c7717515ff01ee5848154d4b47de3047ae89d78b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-logins.withIndexLock (cognitive 26): provider-logins.withIndexLock has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 4 (11 pts), loops 1 (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":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8167402db9cb265c44f5a537c96368dc65bd14f95dd62f0486dbd833b3d6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"index-file.ensureModuleBinaries (cognitive 26): index-file.ensureModuleBinaries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c514b5e7bd637c31b0769838a24cff8ba2ce6d44739ec237b75edb62ddc4a97"}},{"ruleId":"D2","level":"warning","message":{"text":"openclaw-provider-compat.preserveOpenClawProviderCompat (cognitive 26): openclaw-provider-compat.preserveOpenClawProviderCompat has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (12 pts), ternaries 1 (2 pts) (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/openclaw-provider-compat.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"71021ee38ec7d220afd1ef5f584834c58642640bb9bc67fc9f4ed9b0229e77fb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.skills (cognitive 26): index.skills has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 2 (5 pts), ternaries 4, loops 2, boolean chains 1 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5d6d5ac3f863eaa40c7b0fd623fbfda6b42468289cad9c8fa4aa2d515876e6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.startOptions (cognitive 26): index.startOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0780524d1e2513cb30123583ac341b9beea93e80fa130af4772ac7cb12149e91"}},{"ruleId":"D2","level":"warning","message":{"text":"index.yamlChildSpan (cognitive 26): index.yamlChildSpan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14454}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5fe9f4895ce7c883708dc379f2c308d88670f8ae294fa26ab694b336bfc315"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderLearnSpendLines (cognitive 26): index.renderLearnSpendLines has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 7, boolean chains 4, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a0fb9373be0e5c2d367f3ed491cf3837f531f20e09cabd9849fe8a55ce1b14"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-response.tailObject (cognitive 26): provider-response.tailObject has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-response.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acff83bd886b29e86d11d42e96fd30df03661a2afc5cb80fca550bfa9540651"}},{"ruleId":"D2","level":"warning","message":{"text":"loadSurfaces (cognitive 26): loadSurfaces has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 5 (6 pts), boolean chains 5, error handling 2, ternaries 1 (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. 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":"skills/verbs-gate.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6031529b068ec4b588ac89ededb54021dbbc6a7828f420a014cf9e9492f746"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.collectJSONRecordGroups (cognitive 25): engine.collectJSONRecordGroups has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 14). 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":"engine/retrieve_query.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e3d663bd8dccfa66411ae7f81bcf5cb2e098f0245a47557f19d17b933bfcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.RestoreLineNumberedListing (cognitive 25): compressors.RestoreLineNumberedListing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_listing.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5f1f0657b3a4c3e826424892478910d32181a5f6bbe95e0e41f932b3c1aad3"}},{"ruleId":"D2","level":"warning","message":{"text":"configCompressor.compress (cognitive 25): configCompressor.compress has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 4 (nesting depth added 4). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"engine/compressors/config.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"57275ff3443409ec87f15bed28528653a795ddf51fa04cfd9249b7db828ed93f"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.valueMatchesAnyType (cognitive 25): evals.valueMatchesAnyType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), boolean chains 1, 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":"engine/evals/graders.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"08249529211f0981315686c405ab36d2cd530f52b0b61a86b17c4d9a8e4e0d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.summarizeQuality (cognitive 25): evals.summarizeQuality has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (3 pts), boolean chains 2 (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":"engine/evals/quality.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"487aa8aeab6f7b143afed636d1743c88847e4340d87a16b9ecd595fde4045e83"}},{"ruleId":"D2","level":"warning","message":{"text":"image.anthropicVersion (cognitive 25): image.anthropicVersion has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, match/switch 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/tokens.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b3d2bdfc8d59cfa550ef468e3f3b4952f34ab31e05356b5c350a1d33d682aa"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.prefixModel (cognitive 25): gateway.prefixModel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (4 pts), boolean chains 3, loops 3 (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa6be25f2b5643d9f8024fd0a6251331a363b3de677fe3fe29f681eeb430d60"}},{"ruleId":"D2","level":"warning","message":{"text":"pool.lockIndex (cognitive 25): pool.lockIndex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 1 (nesting depth added 13). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/pool/pool.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9856343387c89a0299b3225a22e6fee31b6b92c6b836f1c581ea373acbb7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"store.memoryOrphansSink (cognitive 25): store.memoryOrphansSink has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3101cd2c33bef4b044257b9492c379d24a86f5ff758e6b5d12e40ecae52864"}},{"ruleId":"D2","level":"warning","message":{"text":"store.claudeMDSectionSink (cognitive 25): store.claudeMDSectionSink has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_sections.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"52748754a28d6060fa93abd3fd76227c25f740896354ffe464b75284f32ec9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"store.mergeBehaviorScan (cognitive 25): store.mergeBehaviorScan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 7, boolean chains 4 (nesting depth added 1). 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":"proxy/internal/store/learn.go"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a3a7f5b2261f7c6ffd0835455800680cf6e1841b118e4b97e454f67a0c5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"store.buildLearnSavings (cognitive 25): store.buildLearnSavings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_attribution.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"686daa1f506f8f08e6e8f0563aeb23a9678d4c9a4b46d1af2ef89a269cfe9e39"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.strictNode (cognitive 25): translate.strictNode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 4 (5 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a413a8d122baef44f1318a8e55449baa0a24f35408417c8db52a3763e62ba76"}},{"ruleId":"D2","level":"warning","message":{"text":"responsesToMessages.assembled (cognitive 25): responsesToMessages.assembled has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 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":"proxy/internal/translate/messages_responses.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd5161367df67f27bb2f7301a4183e88cfce51c0c8be149ad16d6ea0bb63f5"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.objectMemberSpan (cognitive 25): anthropic.objectMemberSpan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8b4c947ab2d576913e4759dc9a73b23ad1a6662b1a9e5bd6a36af3b57c76c3"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.chatRecoveryCallIDs (cognitive 25): openai.chatRecoveryCallIDs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). 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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"470817ad2fc4b7a15f1f7f66d37e7b3ebc4e4162377963f6686075b4e4a8814e"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanLLM._stream (cognitive 25): CavemanLLM._stream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (7 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CavemanLLM._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"547980f35ffea7ec6dbe2bc925875964d865300baf1cc2d1864e11ecc4e38e53"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanLLM._astream (cognitive 25): CavemanLLM._astream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (7 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CavemanLLM._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"89acb32e90f062f4c1505a0377145762300df65a92f42dad4c1bbafce95b968f"}},{"ruleId":"D2","level":"warning","message":{"text":"learn-autopilot.runAutopilot (cognitive 25): learn-autopilot.runAutopilot has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 4, error handling 2, loops 1 (2 pts) (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. 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":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acb80c0c94ee828f3a424cdec355f42b52080ea2953e7b80a10ca868c88a4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.externalRuns (cognitive 25): apply.externalRuns has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f0351bafa48668ada657b240ca50f701e217de13a3e45f5a477d77d5ee5f32"}},{"ruleId":"D2","level":"warning","message":{"text":"index.withIntegrationLock (cognitive 25): index.withIntegrationLock has cognitive complexity 25 (threshold 15). Drivers by points: error handling 9 (17 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c239b6dbbce6829bab8a91330a5ce3c318272d8a65b507c5cac082b66a1f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.memHook (cognitive 25): index.memHook has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":18506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c676ff19ffeafce2172f325e843db511488d8994f707f342070921c847bbe0b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.stats (cognitive 25): index.stats has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, error handling 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19601}}}],"partialFingerprints":{"codehealthFindingId/v1":"af92282237c08c394c0e686fbcdd9b1764c8a86b86363f5b7856eadadc1cd0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.agentMcpRequest (cognitive 25): index.agentMcpRequest has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 3, boolean chains 2, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22709}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bde83b16fe3dcbdbd52519d00613cea3d0f72531b53df86eeb388a33e5ac65"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.toRow (cognitive 25): ingest.toRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 17, if/else 6, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb57e2a6906d68cc02f918087853528168da44f6f898f1acaa60877452d99b5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runDirect (cognitive 24): main.runDirect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5334cc3a0d894dfb1c08bbe987feaba4250d3abd568ba7daa029767b5baf91a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.inspectFigures (cognitive 24): ccr.inspectFigures has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_repair.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31ee240b9066526bf6be607e7717813ea376b89d9e4797cc4e82b2b7bf522f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.salvageObjects (cognitive 24): ccr.salvageObjects has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"engine/ccr/store_repair.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeffd266d72d1b39b20f827485deadcb6714f628088aefc04846b04c80fe04f8"}},{"ruleId":"D2","level":"warning","message":{"text":"mem.bm25Scores (cognitive 24): mem.bm25Scores has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (11 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/bm25.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5517f5bff93156940f5871799ffdf5a1be3db754216ae6de31845eaf4489a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.observeCachedPrefix (cognitive 24): Server.observeCachedPrefix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 5). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"80833cbad683ff9bc9c3638d608ade452377678e143f103adb5a085706d180ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.Identify (cognitive 24): Resolver.Identify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/identity.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3953fecaf19f3889ab01d8c224d75a1667961462e4ccf8545fab9b4bc3a2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"oidcVerifier.fetch (cognitive 24): oidcVerifier.fetch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/oidc.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5ab51803e8bb54a09382f4ea87d07015c098b4be12823a8531385b9c9cb0df"}},{"ruleId":"D2","level":"warning","message":{"text":"store.procedureSinks (cognitive 24): store.procedureSinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_procedures.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f3f6d13713321999e5d1b71dec60d58a6ff67004778d1dd2a82ce175c91a76"}},{"ruleId":"D2","level":"warning","message":{"text":"store.crossProviderSinks (cognitive 24): store.crossProviderSinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f247e1ec74c5d75c8f2e3eeab0a2faf3b406f0678e0320b78e8cb21088dda64d"}},{"ruleId":"D2","level":"warning","message":{"text":"store.detectLearningLoops (cognitive 24): store.detectLearningLoops has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_loops.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56a98ceb7193ce1587a59a4956b4babe2d3230f0efbe5200c0474162997e16"}},{"ruleId":"D2","level":"warning","message":{"text":"store.trendSparkSVG (cognitive 24): store.trendSparkSVG has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3, boolean chains 2 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_trends.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aee70b50bf11b3edeee348d07c1a35915fcb752678bceb4232bc61c77c6161"}},{"ruleId":"D2","level":"warning","message":{"text":"store.parseAiderHistory (cognitive 24): store.parseAiderHistory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 2 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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":"proxy/internal/store/source_aider.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d7a153d61971fa56bfed0b709ce0adb23ece9ef6eb429d70ef0b253e32b338"}},{"ruleId":"D2","level":"warning","message":{"text":"store.parseCodexFile (cognitive 24): store.parseCodexFile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b528074d9d35cc59911322ee4e11e16c06635124af1cc54f58446cc6ed5a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.InitMiddleware (cognitive 24): Store.InitMiddleware has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff47cb6b9f7ff21bb280d41bc67d5a3493e060356b36f5d95bf14987bbb42f"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.appendToolMessage (cognitive 24): translate.appendToolMessage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 550). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73fd442b85c1115e33b5a53ecbbc3fc8ee34882f062fedeed87b9abf5e4cee5"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.bridgeTools (cognitive 24): translate.bridgeTools has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec3fc8f49a7a2aae8e73b6b638fd2c29a3b12d8a6672125e8293f6e7c937262"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.recoveryToolUseIDs (cognitive 24): anthropic.recoveryToolUseIDs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e944db71ad50282064467eb179c13b66f52be7511c2ed7c9158f123a3e6314"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.normalizeBedrockCacheDetails (cognitive 24): bedrock.normalizeBedrockCacheDetails has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 2 (4 pts) (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":"proxy/providers/bedrock/usage.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bd9026dd75650246aa484fb443bbd71c73504672fc278bf0ab49374080b7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"langchain._message_view (cognitive 24): langchain._message_view has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd8e0648758e2a6051f0fa77db7c24c4138a4d1ba22b247dc4d85b212219143"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanModel._project (cognitive 24): CavemanModel._project has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 10, error handling 2, ternaries 1 (2 pts) (nesting depth added 1). 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":"packages/middleware/python/caveman_middleware/pydantic_ai.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"54178472453c4975342c8550a5293e7c8bcc24561201a3770a78049afb1a13ed"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseWrapArgs (cognitive 24): index.parseWrapArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (nesting depth added 12). 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":"packages/cli/src/index.ts"},"region":{"startLine":6298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0175a9e671f406daed477f0a8c2a622f7ea6a0ffacc84cb1b9d95e9f308ef7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.logout (cognitive 24): index.logout has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (5 pts), boolean chains 4 (nesting depth added 11). 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":"packages/cli/src/index.ts"},"region":{"startLine":12979}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdc2c6f6dfffaf899cd306846e2f07d0c789ded5ba80806a036f1791c8400a8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.decodeYamlDoubleQuoted (cognitive 24): index.decodeYamlDoubleQuoted has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (7 pts), boolean chains 2, loops 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":"packages/cli/src/index.ts"},"region":{"startLine":14321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1372395ded6b4921bb3a581c43d2aa995d5e7341586dfa0ff0bde1609ecc9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.installSettingsHookGeneric (cognitive 24): index.installSettingsHookGeneric has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (7 pts), boolean chains 3, loops 2 (3 pts), error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcca374b92464144de002125994d3a6c71db43b3f9e56b9e8947508a9b88a7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.enableHermesPluginInConfig (cognitive 24): index.enableHermesPluginInConfig has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 2, loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80ae235bdfc935560916021e124bed5d87f73871b9683448c2d226dfab81e9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.receiptsVerify (cognitive 24): index.receiptsVerify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3, error handling 2, boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22248}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f4a40616a4a4fda555de0850d3c30d967072a8c9ae1631239f4ea8305f9530"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.acceptsRecovery (cognitive 24): transport.acceptsRecovery has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 15, if/else 6, ternaries 3. Of this number, 20 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdcca53968830381263db45d3124592cedbc7c37d139ce2a98d7f07f086701a"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.RepairStore (cognitive 23): ccr.RepairStore has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 2 (3 pts), boolean chains 2 (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"engine/ccr/store_repair.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d212c4b458fb048762aeb924c9b042f1e866bb17d801a6cbf48b77455b9e0ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"logCompressor.compress (cognitive 23): logCompressor.compress has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5, boolean chains 4 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/log.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c73be3279acd6897cfcf957754516900eac6e9c89c35cf6e253b8c46d821ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.Recall (cognitive 23): Store.Recall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/store.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d061d93a4d356ced8f481681c8715e6ef159779711a75e6a3dc35ea3c0fab"}},{"ruleId":"D2","level":"warning","message":{"text":"cloudlink.spawnedAgentType (cognitive 23): cloudlink.spawnedAgentType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c6ac7d271b53a3b08376ea327b4ab316ff178214665b37b5876057931f829e"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.poolAnswer (cognitive 23): Link.poolAnswer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fed1a83533a8a1af293b9c7303b956e6532fe8860bab9eb05535108e6bdfc5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.withDefaults (cognitive 23): Config.withDefaults has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 3, loops 2 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/config/config.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"99694d69be1715d94f59c7133ad008ce1d1e798cb07f44727d184193a30cbd38"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.routeHeal (cognitive 23): Server.routeHeal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e3a381eb9b1e6210b3021b14d259d04e04625fc70fc137a70ffa6facdc6cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.prepareChoice (cognitive 23): Runtime.prepareChoice has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (22 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":"proxy/internal/middleware/choices.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"253249f099ca7749431c5b529039fba51c9794940f4fda61f62b673c38b7f447"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.receipt (cognitive 23): Runtime.receipt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 5). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/recovery.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef5da4f184ad23d5082cb32f75f39b25cefe396c5525762fc92b9fb8f5d7737"}},{"ruleId":"D2","level":"warning","message":{"text":"store.buildLearnPortfolio (cognitive 23): store.buildLearnPortfolio has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 4 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de34cfee44efae38e8a4a7f475fc69479a97d1ee6ac6ac312f33195d575b4f2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqliteMiddlewareTx.ExpireBatch (cognitive 23): sqliteMiddlewareTx.ExpireBatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64e03f222fa9264bc09d0fa31cf0b567a63b119332033120a91d16f6fd8ae4f"}},{"ruleId":"D2","level":"warning","message":{"text":"recurringMiner.observeBlocks (cognitive 23): recurringMiner.observeBlocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/recurring.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"730a7790b73f8733deb8e7dc8a37b6b5431df2af6c895ee9169ed25eb7cd7d38"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.injectAnthropicCacheControlRaw (cognitive 23): bedrock.injectAnthropicCacheControlRaw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/cache_points.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"116a0986b3d7344befcd160d32db132984179f6feaf24bd1cf4656357b1f0912"}},{"ruleId":"D2","level":"warning","message":{"text":"agno.with_caveman_agent (cognitive 23): agno.with_caveman_agent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ec39394444b0cceda7c4d903fdf1374666644c9bf61e799cbb24ba32dcab66"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime._telemetry (cognitive 23): MiddlewareRuntime._telemetry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 3 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b1c99c082084ec0980f4cc4056eb052adcf199b5a1d14a9cc98dd90cbe89a8"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-routing.unforwardedProviderHeaders (cognitive 23): provider-routing.unforwardedProviderHeaders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"packages/cli/src/provider-routing.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c87c86437e654bebc553a8c68c0f3b47de79babadb7300bd2e52e24ab8c9396"}},{"ruleId":"D2","level":"warning","message":{"text":"index.acquireClaimLock (cognitive 23): index.acquireClaimLock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 12). 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":"packages/cli/src/index.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c1ae08361a914c092bd702f787e582a0c24db1407d0da901f2a75a04ddeb9f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.removeNativeHookEntries (cognitive 23): index.removeNativeHookEntries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":10974}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd53d29523d3085c3528c3efc1c8755c0a784a12d3ef8945e14bef30e7384331"}},{"ruleId":"D2","level":"warning","message":{"text":"index.applyConfigFileInjection (cognitive 23): index.applyConfigFileInjection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4 (6 pts), boolean chains 3, loops 1 (2 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":"packages/cli/src/index.ts"},"region":{"startLine":12252}}}],"partialFingerprints":{"codehealthFindingId/v1":"757877a24ecbb947fb7f3e79f5ed8f83e5b810d24f785d0a6240e79b1ef172fd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.mcpUninstall (cognitive 23): index.mcpUninstall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":14747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d427eafdfd0f8da8e656085f559cc7ec8cba6e83a22c69c2cb29e594195f60"}},{"ruleId":"D2","level":"warning","message":{"text":"index.emitShrunk (cognitive 23): index.emitShrunk has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), ternaries 3 (6 pts), error handling 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":"packages/cli/src/index.ts"},"region":{"startLine":17273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3c35b64e110dc6ba04136701023043744d7cb9188d81ffe5518e771f6dbaf2"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-compat.compatForRoutedModel (cognitive 23): provider-compat.compatForRoutedModel has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, if/else 4 (5 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd88bb98e8e9b4063f0f2284ce3c7322c25aea9cc10a562232344ffeb892f8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicyClient.refresh (cognitive 23): RuntimePolicyClient.refresh has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, error handling 3, ternaries 2 (3 pts) (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8e46fda7ec1a57da674fe442d0b37f781a36910a15f2faecf11e1d0f6739f"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicyClient.evaluate (cognitive 23): RuntimePolicyClient.evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 5, boolean chains 3, loops 1 (nesting depth added 1). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ebc556febb8fab4277a571a986d98f3074b511fb7ba68635f98e1717a4244c"}},{"ruleId":"D2","level":"warning","message":{"text":"cavecrew-model-overrides.applyOverrides (cognitive 23): cavecrew-model-overrides.applyOverrides has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"74158ea19a3e775c0c416c07d757e0f0d73a3eba6145dee2033779eea28652fc"}},{"ruleId":"D2","level":"warning","message":{"text":"validateHookFields (cognitive 23): validateHookFields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68a878313503ec5526dc00f414e8936fec137a4e221fd9976e0e921aebabcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"loadJournal (cognitive 23): loadJournal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 3 (5 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dea4884c0a508b1afe063927de5d313f2bb7224ee7bf1d5759fd9e62ab8ca79"}},{"ruleId":"D2","level":"warning","message":{"text":"collectUsage (cognitive 23): collectUsage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 6, error handling 2 (4 pts), loops 2 (3 pts), other 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d13e1a1af253c679a66dbbfbe6936d733e5413655ca5ecedfd1df35b9ed5e28"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.reclaim (cognitive 22): Store.reclaim has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_reclaim.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecec2dfc6d3ea65cbb53570000f76460ddde66f4b4323d00544376bc2e23505"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.unwrapCodexExec (cognitive 22): engine.unwrapCodexExec has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 1 (nesting depth added 11). 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":"engine/codexexec.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a18719c8d95efc73dc632ea9d6dd9ecb31642aae0e09ae0bad4a3fb128103c"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.writeTOONArray (cognitive 22): compressors.writeTOONArray has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_encode.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1619f1889f4f8e95c3af8a9e8bd9e8be45027d4e4c67f52e92a860b93ad97adc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runTrial (cognitive 22): main.runTrial has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9c6ebdbecc8ae0971b0cea9c4f3ebf23f248aa368d93d69fb2767b17805270"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.toolNameInList (cognitive 22): gateway.toolNameInList has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4924013196005daca724958f67c45a68d675c69ad52fca496d55145cb143cabb"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.pixelRequest (cognitive 22): Server.pixelRequest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/pixel.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb6793c99831e92f6c4e818e72cf503deaec8f2ba1fd3de0ba0ded438b74e5"}},{"ruleId":"D2","level":"warning","message":{"text":"store.readSkillFrontmatter (cognitive 22): store.readSkillFrontmatter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 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":"proxy/internal/store/config_scan.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f0b1a7c965eb78830e330c66b772afa8a70f7f65781a2ba27c814338f62194"}},{"ruleId":"D2","level":"warning","message":{"text":"store.simpleShellWords (cognitive 22): store.simpleShellWords has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_reread.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9c2417abe1d23e0b8e29345bd99d9166da8fcabe6189c2a0c748d3f09a9002"}},{"ruleId":"D2","level":"warning","message":{"text":"requestScan.number (cognitive 22): requestScan.number has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1, match/switch 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/inspect.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f42822042de98f179467f6c1567d18f297785e684dc2b26b5c92ab8dc3c6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.chatZones (cognitive 22): openai.chatZones has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/content_compress.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56afdd516e14a1a7c867a6900e3d58257b89b9d3067d9eedb1e8412f17f3864"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.collectOpenAICandidates (cognitive 22): openai.collectOpenAICandidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/content_compress.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9aae9fee7923195628745e9bfb76616477b097d592e76b1f144eebe5ecc8c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Provider.Credentials (cognitive 22): Provider.Credentials has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd6c3e6572625887bd78e2b4c12836658e4dcf0a0b6da6840be92cd1e50b262"}},{"ruleId":"D2","level":"warning","message":{"text":"_native.accepts_recovery (cognitive 22): _native.accepts_recovery has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9424746b9972d1445de87305ce8575311689e767920cb5b8953a747d3db1e"}},{"ruleId":"D2","level":"warning","message":{"text":"agno._message_view (cognitive 22): agno._message_view has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c9ae3cfd229b2e411b9a96a177a8aacad7969aeb93845d1e8f85fd7da7140b"}},{"ruleId":"D2","level":"warning","message":{"text":"google._apply (cognitive 22): google._apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (nesting depth added 9). 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":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9531463cb896d787a373560934e4426815aa9257a9c192810790ff2d1225780d"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.signInStep (cognitive 22): onboard.signInStep has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 4 (5 pts), error handling 1, loops 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. 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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc0d9fe73c8c092810eb21c2db805ddff7823e5f922fc8277ad7c3c7a9d8939"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveInvocation (cognitive 22): index.resolveInvocation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66ac115d8e22fed8f56e884d390aa3d7572ed4ae03331fc16f47f6dbfa817b1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resolveCapabilities (cognitive 22): index.resolveCapabilities has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9dc6afd33c7ff594f6035bdee2aa639552ff62fe6594334eacb588c68f0297"}},{"ruleId":"D2","level":"warning","message":{"text":"index.geminiRouteShadow (cognitive 22): index.geminiRouteShadow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9052}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea38f069e877ba9d969334cc8bd772b548a600ad25337cdc5abfc1035927f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.aiderNativeConfig (cognitive 22): index.aiderNativeConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4, boolean chains 3, loops 1 (2 pts) (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":9863}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1a0f615dbc6b5b4d5ae641e4d655e0db43ae0256d78c895076cb30813cc077"}},{"ruleId":"D2","level":"warning","message":{"text":"index.applyNativeMutations (cognitive 22): index.applyNativeMutations has cognitive complexity 22 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5 (7 pts), loops 2 (3 pts), ternaries 2, boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":10603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3522847f69abd4b821fd36257fef123b4184ef0b68982f60a50a69a8ebf86242"}},{"ruleId":"D2","level":"warning","message":{"text":"index.installNativeVoiceSkills (cognitive 22): index.installNativeVoiceSkills has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 4 (7 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10803}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a97556bdb5d039584cfbe7076256d54d048b18b5aab46c1079e02b1cd8f635"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readOwnedMcpPendingJournalAt (cognitive 22): index.readOwnedMcpPendingJournalAt has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 5 (6 pts), error handling 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16511}}}],"partialFingerprints":{"codehealthFindingId/v1":"810c05ea566784975dacf640f1ba90e95958637ac6b1b0c40743ff942c1a4fae"}},{"ruleId":"D2","level":"warning","message":{"text":"index.traceSearchBody (cognitive 22): index.traceSearchBody has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 3 (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":"packages/cli/src/index.ts"},"region":{"startLine":22424}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e93c8d92ea71f3206604b4ed456afeb0b90c790a0e40e7acfb0c6b2c224b8"}},{"ruleId":"D2","level":"warning","message":{"text":"compatibility.frameworkGate (cognitive 22): compatibility.frameworkGate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/compatibility.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"018ef9e72433eec20ba00451995ea65e62f7d130e94cf82532ce319c891ea8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicyClient.verifyBundle (cognitive 22): RuntimePolicyClient.verifyBundle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e374fb23b6a6c3c537ed7b6f18218f1f0098779ee395a3007529068b411d63"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.CavemanPlugin.experimental.chat.system.transform (cognitive 22): plugin.CavemanPlugin.experimental.chat.system.transform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06e1409c3ddcd0cee574b3900783b68ca55bac98a3871b225ab1512b50d9e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanPlugin.experimental.chat.system.transform (cognitive 22): CavemanPlugin.experimental.chat.system.transform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca63c503739960f841c25cc00b1e07463309bc074f9b040ed05b1a35b24346b"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.gatewayFindObjectField (cognitive 21): gateway.gatewayFindObjectField has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc883ab6f61171a8fb92218c98f5c007bc89e7aa6c10a8ab41e5b73eec19b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.requestAccounting (cognitive 21): gateway.requestAccounting has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a87a78d9f6b26f0fed4114a75785f6ea2fd53aa3918c0a668a6ffc4a27800b7"}},{"ruleId":"D2","level":"warning","message":{"text":"store.memoryHealthSinks (cognitive 21): store.memoryHealthSinks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d924f821e9df7fa54e4debba3fa1edd04d2c49c639e344f993dc1a11d73c09"}},{"ruleId":"D2","level":"warning","message":{"text":"store.buildExperimentReport (cognitive 21): store.buildExperimentReport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 2, match/switch 1 (2 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":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d52a495c127e894b1e08b32160e01719104e14108af865deda5f0fe428c8216"}},{"ruleId":"D2","level":"warning","message":{"text":"recurringMiner.merge (cognitive 21): recurringMiner.merge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/recurring.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"738865a8b616e202aeab40043df09a1c698a72a29effdcde1913d6ab275c56b8"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionEventConsumer.resolveWindows (cognitive 21): sessionEventConsumer.resolveWindows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/session_source.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"59467805e1eab7755e1d72e6ff1ed3fccddf5a6f2bf6857c62ebc8e841f8a842"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.namespaceEvent (cognitive 21): translate.namespaceEvent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc05e5c560b2e7e23dce5e480a56424f660dff0d2626cbc2d67d4df20af668e6"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.findObjectField (cognitive 21): anthropic.findObjectField has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"627fcec0c6eb6052d398acbff160f942077a8250901cc5c3a5012714d06c234a"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.InspectRequest (cognitive 21): Adapter.InspectRequest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/routing.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"58579c666b968418976ab98f5425fb21aefb08c77ee8e635deb9a55572f55972"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.validateBedrockRawTotal (cognitive 21): bedrock.validateBedrockRawTotal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"014ae2a28947342c42bf2f09c9a8b974ff1ccecc0be6351d1bc5d94a0284bee1"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.prefixSignature (cognitive 21): openai.prefixSignature has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5 (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":"proxy/providers/openai/cache_key.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1492818df66387975eca2df767d79637e099f29f94c54fe4a073b2798a5f6ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.findObjectField (cognitive 21): openai.findObjectField has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/content_compress.go"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"899db106d19c319fb5fa1bb8b9bc5288f3d5226caceb23795819da0dec0b6614"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.with_caveman_openai_tools (cognitive 21): openai.with_caveman_openai_tools has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/openai.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0bec92971b47de0b680442cd5d51abb53682e94dac003e812d1d7b88a83c35"}},{"ruleId":"D2","level":"warning","message":{"text":"core._policy_guard_passes (cognitive 21): core._policy_guard_passes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"167912986525a65f6f6362748c22c10c17d0bf70e9430138882051b945e05199"}},{"ruleId":"D2","level":"warning","message":{"text":"check-profile-scope.checkProfileScope (cognitive 21): check-profile-scope.checkProfileScope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/check-profile-scope.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e111de0deb65081fd1ff8b779ebb03ab6d635e7df0b56418bbe4c1bb5973565"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-delegate-mcp.handle (cognitive 21): caveman-delegate-mcp.handle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3 (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":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2477831935345a35e231d54dcf791445515d757d1fab57f08ee51f37f469bf45"}},{"ruleId":"D2","level":"warning","message":{"text":"portable-process.resolveWindowsCommand (cognitive 21): portable-process.resolveWindowsCommand has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 2 (5 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/portable-process.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f769666567ac19c88d2b11ded476bf25ba1146888c82f6b3a7f1fbc435284c9"}},{"ruleId":"D2","level":"warning","message":{"text":"openclaw.appendBootstrapToSoul (cognitive 21): openclaw.appendBootstrapToSoul has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (7 pts), boolean chains 4 (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":"installer/lib/openclaw.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0af2df4aaf8fcad356eea76283984cf0f96ae709fc4e3b0e023978db792b59"}},{"ruleId":"D2","level":"warning","message":{"text":"install.installViaSkills (cognitive 21): install.installViaSkills has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 1 (2 pts), boolean chains 1, ternaries 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":"installer/install.js"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac804c2c2cbadffd83178b600e494389aca48cc879dd61fb32a8347c67bc29bc"}},{"ruleId":"D2","level":"warning","message":{"text":"learn-autopilot.claimLearnNudge (cognitive 21): learn-autopilot.claimLearnNudge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 5 (8 pts), boolean chains 3 (nesting depth added 5). 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":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a842ad0bb6a642a6a017f4fb152064438681217ebf491f056dfdd9ccf193769"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.foundRows (cognitive 21): onboard.foundRows has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6 (7 pts), boolean chains 3, loops 2 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff29b41070fa0a5fb43f02962980852e3f006d708f7617eedbaacf0bd263fe"}},{"ruleId":"D2","level":"warning","message":{"text":"index.clearAutoModelChoice (cognitive 21): index.clearAutoModelChoice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4431}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c825c17aebbe9a04e62c49b88c3aa6f2110159a9291fdd66d40d0bd929cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.capabilityConfigCommand (cognitive 21): index.capabilityConfigCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4781}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b1704a6e5937eb38c93b3454761b8b22d1eb20fa6011b71ec633fe93f609b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.routedAiderArgs (cognitive 21): index.routedAiderArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6616}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fee6adfab0b1bd4d84c6b231a2f760764e673a2a86938b3205df145a65ed4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"index.codexHooksTrusted (cognitive 21): index.codexHooksTrusted has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, error handling 3 (5 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac09a1adec4198d5cbb0ae53bc5192a58861edfbe3db7b63f4c777af8129f8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeMutationsFor (cognitive 21): index.nativeMutationsFor has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (21 pts) (nesting depth added 15). 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":"packages/cli/src/index.ts"},"region":{"startLine":10775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58d1a751ca31aa3f2c9f0be857dafb8b82b348987ff42db81d367cc2170a1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenMigratePolicySettings (cognitive 21): index.qwenMigratePolicySettings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a29c60d90407b7d3f22ccf04afa6933bbae0e5c2fa3c1be049fc0b206d701d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenEnvironmentFilePaths (cognitive 21): index.qwenEnvironmentFilePaths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":15639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093f631c6160a5ba411496a7a865921659e9fc6cfd098b0a28a24d5fafc7736"}},{"ruleId":"D2","level":"warning","message":{"text":"mastra.remember (cognitive 21): mastra.remember has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), boolean chains 3 (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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"923b65c25b358fbdd4a534ed06b169f597239626787e337144ffe1c52dc70f23"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanStrandsModel.project (cognitive 21): CavemanStrandsModel.project has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 3 (4 pts), ternaries 4 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"packages/middleware/typescript/src/strands.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"85585875a90fa21fc42ee80397bc17be385548d3e2f5ef21765e8881c44f04a8"}},{"ruleId":"D2","level":"warning","message":{"text":"tool-output.shrinkToolResult (cognitive 21): tool-output.shrinkToolResult has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, ternaries 2, error handling 1, loops 1 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/tool-output.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f20d3f8ed4817960d20dd82cd6b3508298736bf4edd0b2b643d868147c95403"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.checkPlan (cognitive 21): validate.checkPlan has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (9 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df3ff4795a1112dc6b3b8061067ffc9a71b84ce6ba909a71a3a9b3a08a839d7"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.constructor (cognitive 21): MiddlewareRuntime.constructor has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (7 pts), error handling 2, ternaries 1 (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cbb258680ffb8ff853be1bebe2e5e09942aca506438abb0071cf63f365241c"}},{"ruleId":"D2","level":"warning","message":{"text":"run.parseArgs (cognitive 21): run.parseArgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4, loops 1 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"packages/subagent-tax/run.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"06568d1df99b2b5c491655eb8a71790e625d2aca45c8e76c03b58e09ef590c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-stats.main (cognitive 21): caveman-stats.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 5 (6 pts), error handling 1 (nesting depth added 2). 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/hooks/caveman-stats.js"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"431666518508e6e3419c5de65b36b91723764d82843a732dbdaf2a728efe8dad"}},{"ruleId":"D2","level":"warning","message":{"text":"addCommandHook (cognitive 21): addCommandHook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaed566fa6ee344b53cc0a60494089d73a5415a25543c82da7e46f8c4a4153e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveWindowsCommand (cognitive 21): resolveWindowsCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), ternaries 3 (4 pts), other 2, boolean chains 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"090849fac56a501a5bd4bf1d5de6b2213ba7311a05a42abc542605faa054eda1"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.tokenize (cognitive 20): compressors.tokenize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/redundancy.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0699087d7b37abe79dc7756ce16b2ce8aa2a50eab328f0bf782da20e30b151"}},{"ruleId":"D2","level":"warning","message":{"text":"evals.toolNamesFromValue (cognitive 20): evals.toolNamesFromValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 2, 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":"engine/evals/graders.go"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5ebc5d3d64614a740e0891a148b0c4b629d50ec8ff081215633532386a4116"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runRecoveryStore (cognitive 20): main.runRecoveryStore has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 4 (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":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada295b81b4220b4c88c0afaeefd0bfa82cf84bfe627befb1888467f2eb03c23"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.compiledPlanRoutes (cognitive 20): gateway.compiledPlanRoutes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5761398dab1cba2180058969c60f97ee3fd5f40c3a0dfb0fefc54fca344fba33"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.standalonePriceForUsage (cognitive 20): gateway.standalonePriceForUsage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, match/switch 2 (nesting depth added 3). 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec842e8e33a1ae0433abfdeb178cd9f0f7d12c069da529899eb27a61d76d4afd"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.copyFlush (cognitive 20): gateway.copyFlush has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (nesting depth added 12). 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52702436b33c41d4d1108f754fded4eace348e6591ba84e5ea473a305f81163"}},{"ruleId":"D2","level":"warning","message":{"text":"chatGPTSSECompletionReader.Read (cognitive 20): chatGPTSSECompletionReader.Read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"3483c7eb3c04b98636f3bf76689fa33c9c9b0c55038906f4870aaf12b626d449"}},{"ruleId":"D2","level":"warning","message":{"text":"chatGPTSSECompletionReader.scan (cognitive 20): chatGPTSSECompletionReader.scan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a6d801a1febef96f55d675f34d8c86a8eae068d73bdaeb65d6a6c9ccbf91f4"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.loadTokenMap (cognitive 20): identity.loadTokenMap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/identity.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d14ecaa098aec0323822d39e9c4af0c0272d5960103188ee50d67011a6043a"}},{"ruleId":"D2","level":"warning","message":{"text":"nativehook.currentRepositoryState (cognitive 20): nativehook.currentRepositoryState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, loops 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ebd20e3b1749977f449e36ca33ea45a1cb87d9066722152c15c78244718792"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.LoginChatGPT (cognitive 20): Store.LoginChatGPT has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"proxy/internal/pool/chatgpt.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"356597d603422efa9370683fce0567480bed7b6d5c82c19f4edd7d2b28dda879"}},{"ruleId":"D2","level":"warning","message":{"text":"repointel.ImpactTests (cognitive 20): repointel.ImpactTests has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6742328769c55d683dbf9aa5fc808167973790be69afc04c061c1bc0d7bfc47"}},{"ruleId":"D2","level":"warning","message":{"text":"store.bashReadPath (cognitive 20): store.bashReadPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_reread.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d861a61c62beddef781bbe8ace3d7820b4a2689a723a8c7745c951f60a5fb52"}},{"ruleId":"D2","level":"warning","message":{"text":"procedureMiner.observeSession (cognitive 20): procedureMiner.observeSession has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (7 pts) (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":"proxy/internal/store/detect_procedures.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de34fb97b8e766da683b9afb7e60a8633bf5aa6b648b4c0f039782b3c19f43b"}},{"ruleId":"D2","level":"warning","message":{"text":"geminiSessionSource.scanSession (cognitive 20): geminiSessionSource.scanSession has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_gemini.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"875e3b7dc14e3fa4065e84dd24e479695848abf37c98db5aff3ba14da18185ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.InsertConfigSnapshots (cognitive 20): Store.InsertConfigSnapshots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8314b18b8cf0ca96fad65a3aa5c4a521f9bda84c8092ac75d27ef979a06fa819"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.messagesChatBody (cognitive 20): translate.messagesChatBody has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cfcef20e82ca72036b62d7ff9bc98145f363736aa739908df7a316dda15baa"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.appendResponsesToolOutput (cognitive 20): translate.appendResponsesToolOutput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 841). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01861410a0231df8b6d2e81561c20cb5828f1f7b7920e5c300868dac0804466"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.messagesFinish (cognitive 20): translate.messagesFinish has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 3). 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":"proxy/internal/translate/msgbuild.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2e021704d50c629b86f5a528f577e0b7a59242241270c477906693e876ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"gemini.collectUserCandidates (cognitive 20): gemini.collectUserCandidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/gemini/content_compress.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec140ba8b4eef0ef2cf22af1b2f21a558abd9aacd02cf17358148d4d903e2b8"}},{"ruleId":"D2","level":"warning","message":{"text":"requestScan.object (cognitive 20): requestScan.object has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/inspect.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"70171745dace9a4fbfcb1c53a27a345e4ba3d992d022896c0571415fa87162f4"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageReader.feed (cognitive 20): UsageReader.feed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_usage.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c7a455351ef7f6ec370bee1187ceb51809da858c8ece2af3da129353b532f"}},{"ruleId":"D2","level":"warning","message":{"text":"OTelExporter.record_span (cognitive 20): OTelExporter.record_span has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 3, loops 1. 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9d440eaf1e86352d0960eac55b8d37b86c14f14ba7d90a0756cd160f9c9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime._http (cognitive 20): MiddlewareRuntime._http has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 3 (4 pts), error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84d5c39aadcd6f746ae96fc1371588f7799b429fcaddd4314d24505dae69419"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-mcp.handleMessage (cognitive 20): agent-mcp.handleMessage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7fa26248efab31c6d3cb1fdb5e911e854b67ed32c1adbd47fab78266c499d5"}},{"ruleId":"D2","level":"warning","message":{"text":"portable-command.resolveWindowsCommand (cognitive 20): portable-command.resolveWindowsCommand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/portable-command.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb9aebfad349b08a03c647bf02ee60b340058e4fc3b3c2c5e14bcdbf8b94b87"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-logins.providersAdd (cognitive 20): provider-logins.providersAdd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e409f9c7d3d6d4a82a73ecebe8ba3a731bd4e87bba035c71539bdee11d44abd"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.routingStep (cognitive 20): onboard.routingStep has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5029f16c399877498132bfc20bb1bc218c185324643ed056fe3d7371ea32e043"}},{"ruleId":"D2","level":"warning","message":{"text":"index.preflightAgentNativeBundleComponents (cognitive 20): index.preflightAgentNativeBundleComponents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b18fd41a479940004e8c377ec5ca4d8576b3ce0f4151927195a961effa426"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderRetroReveal (cognitive 20): index.renderRetroReveal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). 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":"packages/cli/src/index.ts"},"region":{"startLine":6095}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ecd74252d29437dc6263be8e5fbbefadf9e6c51b918b249b26b3bf4945e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.stripTrailingCommas (cognitive 20): index.stripTrailingCommas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (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":"packages/cli/src/index.ts"},"region":{"startLine":7389}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ba3b1ba1922a7855ba5bd648114987396e33e0adcfd5cedb6227244f0a98ca"}},{"ruleId":"D2","level":"warning","message":{"text":"index.withMcpConfigLock (cognitive 20): index.withMcpConfigLock has cognitive complexity 20 (threshold 15). Drivers by points: error handling 8 (13 pts), if/else 3 (5 pts), boolean chains 2 (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":"packages/cli/src/index.ts"},"region":{"startLine":10531}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ccd054959854fca15584075be6718307d1fb02761f09b63b2a3a93d28adbe0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeRoutePinnedFor (cognitive 20): index.nativeRoutePinnedFor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (routeIn). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10703}}}],"partialFingerprints":{"codehealthFindingId/v1":"af56d67dbd1388e070b5bdeb7ef6e819f36716d45c3f67fa50f070649fb0cbe1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.validateLoginArgs (cognitive 20): index.validateLoginArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12793}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0b553846f41676b082b1b9c431120c4777f05aae79b6d0902208614354e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenSettingsPermitRecovery (cognitive 20): index.qwenSettingsPermitRecovery has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff97a41db4a0e91945a098787f382751201abbe59a7ce08859eec0ce6023edb1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.ownedMcpRegistration (cognitive 20): index.ownedMcpRegistration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c252b579149788ee1d0266a89c83ed48415abcda03a8aacd69f76c92823181eb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.installMcpCodexToml (cognitive 20): index.installMcpCodexToml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 4 (5 pts), error handling 2, 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":"packages/cli/src/index.ts"},"region":{"startLine":16965}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd88fcd5c12dbba591766f38b7a65f4de049f80ec21d7f5cc6fd7d1f6b99f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.normalizeExperiment (cognitive 20): index.normalizeExperiment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dec26f331fac43f86162d88f6bba35971285c34d09447331f6d5adf6447deb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.toolSearch (cognitive 20): index.toolSearch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 5, loops 1 (nesting depth added 1). 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"28baaa02cdb09d3bf54a228846ed92537c97106d6cd72f7ffa95b64ae646fe04"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.resolveProxy (cognitive 20): protocol.resolveProxy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, ternaries 2 (3 pts), error handling 1, loops 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":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b51abb30e93405984d23945b6efd9f184be8ac4f7fee174eafe0fb169a08b7"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.report (cognitive 20): MiddlewareRuntime.report has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (16 pts), boolean chains 2, error handling 1, if/else 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cd2d93952a085cb80c6f54200c547163bcef096bedefb973ebe68b1d2a47b7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.pixelDensityChecks (cognitive 19): main.pixelDensityChecks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5814b249f49245463f32c249e5f7fbc65e407b754d58682fea89feb6d6265e"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.SplitLineNumberedListing (cognitive 19): compressors.SplitLineNumberedListing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_listing.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b524fb35b9524e8743a48fef62cc28d77878179e0feb6fed872bd8a116bb2da6"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.skipValue (cognitive 19): compressors.skipValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c58e3bcd5d881e1b3e32db1ae1d0951394393f1d4529230d70067066375d2e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Detect (cognitive 19): Engine.Detect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5 (nesting depth added 1). 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":"engine/detect.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f802cc7741c444b1251a9cf0ce0c22801d0fde2b2600efc674d4f7d29e676085"}},{"ruleId":"D2","level":"warning","message":{"text":"image.Apply (cognitive 19): image.Apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/image.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb175839242630532fc1339764838442fa4acb252050446a7ab0de6dea6347f"}},{"ruleId":"D2","level":"warning","message":{"text":"fanout.enter (cognitive 19): fanout.enter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 252). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e434c3519afba615126caf74b2302f602c68963eab66d3d6940802a3d26ea4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.optimize (cognitive 19): Runtime.optimize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 2 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/runtime.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a56742f5bcab0de3465485dc8c9d77081d8937670e358f715f3482070c0a25"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeruntime.StripSessionMarkers (cognitive 19): nativeruntime.StripSessionMarkers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 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":"proxy/internal/nativeruntime/marker.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c615cdf4589bc01bbecb3143d29e6be17aa6f6a1fc68426e38c028cb852d645"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeruntime.ServeUnix (cognitive 19): nativeruntime.ServeUnix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/server_unix.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5395b47c3a3a1cdd11bd68bfbdd33a1a9e495cac7664a88d5fc1957d4228c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.Entries (cognitive 19): Store.Entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 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":"proxy/internal/pool/pool.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"96039a78d463ddf90c5dffe3248cca225c0b5ac96e4ef9c71281f26052a9bf60"}},{"ruleId":"D2","level":"warning","message":{"text":"store.brokenImportsSink (cognitive 19): store.brokenImportsSink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f973a4ebc8259f4e4ca3146e656099bfece897e6fccc6333746a8dc0290d282"}},{"ruleId":"D2","level":"warning","message":{"text":"store.staleReferencesSink (cognitive 19): store.staleReferencesSink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aace1bf0629b831ba3d7f2199a7b4c5c4c2294eee8b9ab49928724840cea4c"}},{"ruleId":"D2","level":"warning","message":{"text":"store.learnRepos (cognitive 19): store.learnRepos has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 2 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420fe06ea8a63ad0e231352bffb2a50f63c2557e6c13f094eb7272bbd743f66"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresMiddleware.initMiddleware (cognitive 19): PostgresMiddleware.initMiddleware has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f6987e5266b4b272edc9a72c7dafd45fe376bc52f0df8c6ca1b5a7157daaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.InsertUsageEvents (cognitive 19): Store.InsertUsageEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7459a2dad2d1c5441d8880423d07306fcd6e05a303a5b01aa35a01e44c717f"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.eachItem (cognitive 19): translate.eachItem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"51985590048302e6682367f5b219be6ab9a04c4f8f50df40dd0ae77dfd03b247"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.messageZones (cognitive 19): anthropic.messageZones has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 6). 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd799e2bbe0b646ceb30830c563bfa1783a51eac13b675ae80680e53006b2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.injectConverseCachePointRaw (cognitive 19): bedrock.injectConverseCachePointRaw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2 (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":"proxy/providers/bedrock/cache_points.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ff59ecbdeb70627f323ebbbd12f1bdf8fe4d728caab8f4357126a3f140a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonsplice.value (cognitive 19): jsonsplice.value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1648a65ce54163f34d6a958135c7132036893f28c39beea016fabab7182d55"}},{"ruleId":"D2","level":"warning","message":{"text":"redact.candidateLooksLikeSecret (cognitive 19): redact.candidateLooksLikeSecret has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2 (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":"shared/platform/redact/residual.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ebd34f83f55f68b499cbbac7318d1aad2b3280c220ffc9a098c4e164772e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"shrink.profileOf (cognitive 19): shrink.profileOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shrink/shrink.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbbd2e7149d81da7d9faf23ecca7cc7c2572c0518fb48e04cfd92514e1d449f"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanChatCompletionClient.create_stream (cognitive 19): CavemanChatCompletionClient.create_stream has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 3 (4 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d16b2a852bbbafe56ce1d2d6f73268488b489be6a147e5e5ed2a9ad87175a5"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanMCPHost._project (cognitive 19): CavemanMCPHost._project has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, loops 2, ternaries 2 (nesting depth added 1). 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":"packages/middleware/python/caveman_middleware/mcp.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f03257a5b95da83eecf91fd3e7cbb60b7aa405c402ae09636fe1845f3d2bc0f"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime._capabilities (cognitive 19): MiddlewareRuntime._capabilities has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, error handling 4 (5 pts) (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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d996099edd5f0ec9987d595f86fdc9e9d333d17107fe7efc9e4a0f88e66cb26e"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.parseOnboardArgs (cognitive 19): onboard.parseOnboardArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a32ee86b105c93a93aa2db1fe0720392cc685295f7457de3404515fd94a214"}},{"ruleId":"D2","level":"warning","message":{"text":"index.recoverPendingAgentNativeBundle (cognitive 19): index.recoverPendingAgentNativeBundle has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 6, if/else 3 (4 pts), loops 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":"packages/cli/src/index.ts"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b67517ddd1e54cd38c2adbaa231f01746764b94516f449509e55cd6ced72bc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.managedHookIdentity (cognitive 19): index.managedHookIdentity has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (7 pts), ternaries 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8058}}}],"partialFingerprints":{"codehealthFindingId/v1":"22265603bfbb69bf62d1f75bed7c1ba7dfc6f3b023ed5916f5674ebe72ac8969"}},{"ruleId":"D2","level":"warning","message":{"text":"index.sync (cognitive 19): index.sync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (19 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5b2b53e1d8cc5305d6d97fe2a8d1118cb9d8f280636bad9613b0b0a6284544"}},{"ruleId":"D2","level":"warning","message":{"text":"index.recoverOwnedMcpTransaction (cognitive 19): index.recoverOwnedMcpTransaction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"packages/cli/src/index.ts"},"region":{"startLine":16602}}}],"partialFingerprints":{"codehealthFindingId/v1":"88651e079ff4cc359861cb1936a06785c7ee0ece808d5d1f19155a6644243cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanMCPHost.project (cognitive 19): CavemanMCPHost.project has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 4, loops 2 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"packages/middleware/typescript/src/mcp.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cbc8c0c272e83674ee73daba4ecd65201e4c16b9a6b076fa287ade05de0662"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.inspectSQLiteGeneration (cognitive 18): ccr.inspectSQLiteGeneration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 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":"engine/ccr/store_generation.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"873717b23b409479843375b9971e1056a39e70252ec6bf6d7e1ef1097b79d343"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.secureSQLiteFile (cognitive 18): ccr.secureSQLiteFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c4e4bcbb68efe82979cca46e150aa0c22788b8116b3b29f57e621fef4aa0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.droppableGeneric (cognitive 18): compressors.droppableGeneric has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 1 (nesting depth added 3). 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":"engine/compressors/axtree.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f378699945c898a2c5c14264f6f6544666ea0d134575eab0834aa169ec8f43"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.keepNumericExtrema (cognitive 18): compressors.keepNumericExtrema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/tabular.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdf39b516bf4b87dd94311423e333296203abc92cec6d9c9c364adcaef79e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.splitSentences (cognitive 18): compressors.splitSentences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (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":"engine/compressors/toolschema.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fff52e3efe8de159083dd8fd0235c9133d0b7b3df90800692b9e4565c78e92"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.writeTOONValue (cognitive 18): compressors.writeTOONValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_encode.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c3a869fe51e0dfb0e0adb3236e015a1291117503e4a32314f92994a5c698d"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.tabularRows (cognitive 18): compressors.tabularRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 3 (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":"engine/compressors/toon_encode.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d80b5cd4f781f3d2bbe8e9b5e2300014f7d9575755af97b520d8ae4fbd76e6"}},{"ruleId":"D2","level":"warning","message":{"text":"diffCompressor.Compress (cognitive 18): diffCompressor.Compress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/diff.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba907a10f93eb9bfa5be40466e53d794e39051ea7445a548c1951cfbe97dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"textCompressor.compress (cognitive 18): textCompressor.compress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/text.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"493b5a73121fc9ce2d0c3b92c13c1ee28ed1d2908e1c1416cddec92290e5613e"}},{"ruleId":"D2","level":"warning","message":{"text":"image.DecideWithDetail (cognitive 18): image.DecideWithDetail has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/image.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8b4141b1c3a7263991b217589c3bfaa26c46d2f31ad2d2b588eb3011be10b8"}},{"ruleId":"D2","level":"warning","message":{"text":"image.downscale (cognitive 18): image.downscale has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/image.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48882cb6caedd0a385883a3b82ea166ddf47b32a55e3e4d1d0d0b56f2cd88b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.Supersede (cognitive 18): Store.Supersede has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/store.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"741112a2e896003fa77f8c9ce959c14d9904124a22bca66166cf1fe858291003"}},{"ruleId":"D2","level":"warning","message":{"text":"cloudlink.requestFor (cognitive 18): cloudlink.requestFor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ae260777d938b84d0de5d73dd1582a1233f3388f42ffb00e4400d70dca9368"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.flush (cognitive 18): Link.flush has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/events.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86213fd3dc0ad3df13f6af02f669dc0b63b71e261c7197aa832c61db84f3454"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.collectAnthropicPixelBlocks (cognitive 18): gateway.collectAnthropicPixelBlocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/pixel.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e540c566e9bbe971b5d74b38af5e787bff90255f219da98714359854b9e3614"}},{"ruleId":"D2","level":"warning","message":{"text":"warmTable.record (cognitive 18): warmTable.record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm_table.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c252e8a2f1a8141221616c04a18b5e47829436366c29882a06f0c8000bd3521"}},{"ruleId":"D2","level":"warning","message":{"text":"effortWire.markAt (cognitive 18): effortWire.markAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"89227d5f7441bf1a6aa001d7314413d55cc9e6b595b93bf22b823065bd8c7bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"releaseOnRead.Read (cognitive 18): releaseOnRead.Read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). 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":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6914eeee114a08a4ce8eadeff48b64738769f5d896d5407bf600b70a532edaa5"}},{"ruleId":"D2","level":"warning","message":{"text":"nativehook.findGitDir (cognitive 18): nativehook.findGitDir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"950f285daba0eda62d240109ac204926aa0275b99fbfbc6fc7fa4a7b876f93c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.UniqueRecentSession (cognitive 18): Runtime.UniqueRecentSession has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e170a525dd7d13556d9f4e5f725852a7e255b0fe1e631e320d816b3a531f9"}},{"ruleId":"D2","level":"warning","message":{"text":"store.toolPortfolioSink (cognitive 18): store.toolPortfolioSink has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, boolean chains 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_tool_portfolio.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5cebab6dd5fb30cc593cae3ba753762732d5608d95791fd0028b29be8613ad"}},{"ruleId":"D2","level":"warning","message":{"text":"store.newestLearnSnapshotSink (cognitive 18): store.newestLearnSnapshotSink has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3868d5f6eb22e12889ce1640513e0dcbe73caec7274cf066738a0fcdc28cc4"}},{"ruleId":"D2","level":"warning","message":{"text":"store.mapReconcileHeader (cognitive 18): store.mapReconcileHeader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts) (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":"proxy/internal/store/learn_reconcile.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"719112e5cb6dfbe83779448c4a74df9ab1e5c26794b293f59c3043e34464448f"}},{"ruleId":"D2","level":"warning","message":{"text":"store.parseClaudeTranscript (cognitive 18): store.parseClaudeTranscript has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1ac087618af6a9f1d47154fee3a2b04c33e8ba74c43de8d2623f4074e4c2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.objectAt (cognitive 18): translate.objectAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"13491339932dc2f95320cc7a6d97f08cb155312099ebe23f96d622e9f3920f54"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.stripForeignThinking (cognitive 18): translate.stripForeignThinking has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, loops 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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":"proxy/internal/translate/messages.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0072773e3075ab46c2ffb83d3ea27c3d45896c630c4010f15ec1621c5f26e108"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.ApplyProviderNativeTransforms (cognitive 18): Adapter.ApplyProviderNativeTransforms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5 (nesting depth added 1). 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":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2325e27d21344a8bed62b068aadf3685e9dfff013437e659a21aba3bcabe7fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.injectBreakpoint (cognitive 18): anthropic.injectBreakpoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"356c23fb0d7b6c7704817ba7170eb5e82066ce3618a5fc39237dccf594ee6909"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic.stripCacheControl (cognitive 18): anthropic.stripCacheControl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23107153e5408b7a883e87d7f71e53408eea37d603a83a3210193060c36d140"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonsplice.Field (cognitive 18): jsonsplice.Field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4772fbe11d8d546631263358ae029978e1bd7c8c5fd8ad7243fd2ef2732bd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.applyReasoningEffort (cognitive 18): openai.applyReasoningEffort has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/reasoning_effort.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bd9c7ed5d946ea178817846bb09dc7e4a3309efa8237233b05c3d65da66f41"}},{"ruleId":"D2","level":"warning","message":{"text":"redact.compileOrgRules (cognitive 18): redact.compileOrgRules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/redact/payload.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bc25919237a82e7e970d841ec5b48cda2ec37c203faaf62cc78daf2bfbabeb"}},{"ruleId":"D2","level":"warning","message":{"text":"redact.screenBytes (cognitive 18): redact.screenBytes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 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":"shared/platform/redact/residual.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034bfc0efb62b4da5e24572b85a69c0c5c79eaa3ec0baaf0a17f5965cdd87c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ssrf.dialContextWith (cognitive 18): ssrf.dialContextWith has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (nesting depth added 3). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fe6aff638f3a6c0826cfc2c107af4bf0ebd475158960cde1c9c40c6e1672dd"}},{"ruleId":"D2","level":"warning","message":{"text":"HTTPTransport.__call__ (cognitive 18): HTTPTransport.__call__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/transport.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3fe7729860667849646e539ed9df70e9c81b3255fa8650f88711376b46c27"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.file_lock (cognitive 18): compress.file_lock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6f845831fd5a2fbe22259d87ad8d3f5195e0d77aad760383ecaebdeda738b8"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.file_lock (cognitive 18): compress.file_lock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5869724461363ec859a78c398f498da237177453d49abcdcd445771319b789e0"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode-agent.transformOpencodeAgentFrontmatter (cognitive 18): opencode-agent.transformOpencodeAgentFrontmatter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/opencode-agent.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1f1f3b2f0f50d694416c1bb034a42cd8a75dbed36e888b9d1e3e01b6bd9049"}},{"ruleId":"D2","level":"warning","message":{"text":"index.telemetryTokenDelta (cognitive 18): index.telemetryTokenDelta has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6, ternaries 2, error handling 1. Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00cc6ff7d2f4c958cadb8f07a8149e749de166af969c4f45e1c9a28e690db80"}},{"ruleId":"D2","level":"warning","message":{"text":"index.start (cognitive 18): index.start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). 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":"packages/cli/src/index.ts"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ee5344a656b0bb70693c7d9147583d60d19af48ebefbc83bf498c00612818"}},{"ruleId":"D2","level":"warning","message":{"text":"index.durableCavemen (cognitive 18): index.durableCavemen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc3a82fbf1e3437240eec7772f1257bd48fed76f9c7f42ac1e298ce5a9d067c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.capabilityInputValue (cognitive 18): index.capabilityInputValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (4 pts) (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":"packages/cli/src/index.ts"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"142c5b85da826b2e597309d3cda2c3794943d4c53e04877220eed03f4616840c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.managedHookTargetsExist (cognitive 18): index.managedHookTargetsExist has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8289}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bbcd2cdae8e4817ed3b5735e95d4a36bf064bf69c13345a074396000f7b8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.yamlMappingChildren (cognitive 18): index.yamlMappingChildren has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, 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":"packages/cli/src/index.ts"},"region":{"startLine":14424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33c0765ab247d646cd9ae1c0add33482d74b78df0c3589d02b39d0926ffbe97"}},{"ruleId":"D2","level":"warning","message":{"text":"index.planRemoveMcpKiloJson (cognitive 18): index.planRemoveMcpKiloJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). 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. This shape REPEATS in the file: one other method here (index.planRemoveMcpQwenJson) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9da373d7e0e7790dc8edcf2ff3d7cd38c8458d9d0e36be7b8c5743492e83f0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.planRemoveMcpQwenJson (cognitive 18): index.planRemoveMcpQwenJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). 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. This shape REPEATS in the file: one other method here (index.planRemoveMcpKiloJson) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4dc0469be619417f47c4e72ef6ce37e9a0495482497fbd22f4edc91f8ef1ea"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeRuntimeRequest (cognitive 18): index.nativeRuntimeRequest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17788}}}],"partialFingerprints":{"codehealthFindingId/v1":"510afee6a74833a0b121b9283b756592c4bed2e498ff4e2a71b41a0349116b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeInspect (cognitive 18): index.nativeInspect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17947}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdb3da3e8832c73b3a5469764455ae6943102cf3948aa19524a7265be7bbb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.verifyFirstRequest (cognitive 18): index.verifyFirstRequest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 2 (4 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19663}}}],"partialFingerprints":{"codehealthFindingId/v1":"67334f6eff18c1a82cad598c342fbc922751bfb939df06da09f502d0b7196e6d"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.project (cognitive 18): transport.project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 5. 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":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e816927f40e0df58d52d83bfbb78c0fffb9a596b3462c5ddeee4ade2c97623e"}},{"ruleId":"D2","level":"warning","message":{"text":"OTelExporter.recordSpan (cognitive 18): OTelExporter.recordSpan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 1). 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8100e7c5446cb72d67056fafeee49d23f7553d6606a864c8d98cf6967def8b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.preflight (cognitive 18): MiddlewareRuntime.preflight has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 4, error handling 1 (2 pts), if/else 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa28b242cd54dbad2ee1cabf3ec5844252348002de57a4d5281075fb6475afd0"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-config.findRepoConfigPath (cognitive 18): caveman-config.findRepoConfigPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"72720fd882012fceb73d682e3d83f3c9b702ee6a685e6c0661b7851e843d116d"}},{"ruleId":"D2","level":"warning","message":{"text":"browse.NewCDPDriver (cognitive 17): browse.NewCDPDriver has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cdp.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e40d4c4aaa524c92862b9692317e9f416629743717c3173e78d529a24b44cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.prepareObject (cognitive 17): ccr.prepareObject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72a8bd52e7115b6d64ca11529b9b18da4d9621390ec0c49df12a8be2755651a"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.InspectStore (cognitive 17): ccr.InspectStore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_repair.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad58c10ee562f2edb7876f4faa10632027fa6f0492e04300ef081c19310df1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.renderTestReport (cognitive 17): compressors.renderTestReport has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (8 pts) (nesting depth added 5). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/testreport.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"291c0ae1cd772fc6c91c4071895c39fb6c75e6983e6f05dda59788c72bc9f3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"annotationStripper.schema (cognitive 17): annotationStripper.schema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c7c0dd63d80f0ac4749ff96df1d89ce14a35253f01925a161e881db7722511"}},{"ruleId":"D2","level":"warning","message":{"text":"main.memTools (cognitive 17): main.memTools has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). None of this is in the body itself: all 17 points belong to 5 function literals inside it that branch (lines 144, 174, 201, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/cmd/cavemem/main.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7590cf85a43045a663dafc3b5b315285ac8a4c57a83bd5ee1b27bf059e698aa"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runStats (cognitive 17): main.runStats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54d38160011bbd416ec0d3538a03219d7053b0fc6f9c6f38611b43c6b652a6"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseStatsReportOptions (cognitive 17): main.parseStatsReportOptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/stats.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bf18e7e3f46220c11b0d444a3ee73b879ec2925b5cde13477d067b9f32620b"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.doUpstream (cognitive 17): Server.doUpstream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4579463806cd8ecaccf5f29b96341b289fc7bb4ae278d5c1b294c600a5601e"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.firstURISAN (cognitive 17): identity.firstURISAN has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/identity.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa119151ff14911d0cfa57f1b5a23139bbbef5b862f24f5aa40264089d726e"}},{"ruleId":"D2","level":"warning","message":{"text":"repointel.gitTrackedFiles (cognitive 17): repointel.gitTrackedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 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":"proxy/internal/repointel/index.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"928d2c7a789db1b25d6780bc152b872945101e23e8c78be58f178a48710630d6"}},{"ruleId":"D2","level":"warning","message":{"text":"store.cacheChurnSink (cognitive 17): store.cacheChurnSink has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_cache_hygiene.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"823fc7eb2ba2de8bf33fa38da740290f3b1e2277947bb2afc4d22602f2022d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"store.caveScore (cognitive 17): store.caveScore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (nesting depth added 2). 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":"proxy/internal/store/learn.go"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce97e7c8d116764555917aaafcb14cb3eca99d142a029ee77db029e8ae60fbd8"}},{"ruleId":"D2","level":"warning","message":{"text":"store.learnTLDR (cognitive 17): store.learnTLDR has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"a703699189e848c921b75f376e96f1210666aa718308c207547d8c0738711a70"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.streamResponsesToAnthropic (cognitive 17): translate.streamResponsesToAnthropic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1, match/switch 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":"proxy/internal/translate/messages_responses.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d02e46a7ed0456988d101a8746058ba5946081303cb4b302f9fa222e39a473"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.Request (cognitive 17): translate.Request has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), match/switch 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6abb9287791dc426104e718a6625ea0ed2a7af2d193062e3300693f3f2bb037"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.unsignedThinking (cognitive 17): translate.unsignedThinking has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 4 (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":"proxy/internal/translate/translate.go"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"356e30e1aeeae992dd91a6bc507a48bac4dd2f356818246aac077f91d3a790ca"}},{"ruleId":"D2","level":"warning","message":{"text":"messageStream.consume (cognitive 17): messageStream.consume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd09c1ed22c69ccc0fc220439c8ce2ab6deac4248ee8c18537c901c0b81586a4"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.decodeAccountingBody (cognitive 17): providers.decodeAccountingBody has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c419dd48f81129d857d7c1ed388a2f20fa5225af0fb79045c7240292aa4ee30"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.mergeGeminiUsage (cognitive 17): providers.mergeGeminiUsage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8 (nesting depth added 1). 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":"proxy/providers/adapter.go"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4509614c967627b7a8fd106367239bc4d81cc63f81807789a42ba893b59c40"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.mergePricingQualifiers (cognitive 17): providers.mergePricingQualifiers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4adb651ba829dce3cb48e47f8a3fbe92ced65176abb7d9a7b961731fb1d92ae"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.bedrockObjectCompletion (cognitive 17): bedrock.bedrockObjectCompletion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8102c8172ba884e808c58e49e3ed76b43fcbda5842fd1af3df9b29bd4ceb95f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.ApplyProviderNativeTransforms (cognitive 17): Adapter.ApplyProviderNativeTransforms has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6. 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":"proxy/providers/openai/cache_key.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e291f5b6cef47e53155448e8ee6695b15342b785b6bb81a51b9c4b29370bbf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"postgresconfig.ParsePoolConfig (cognitive 17): postgresconfig.ParsePoolConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/postgresconfig/postgresconfig.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"43013252190d6f3a88b50743ed6d8c55f1598ec07f3748fb0acf6bd03c0af3c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Cave.tools (cognitive 17): Cave.tools has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 1 (2 pts) (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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c641a3f4103e39eb9357959033cc7322f5fb559d21a26fc3ebff6640a7b2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"HTTPTransport._connect (cognitive 17): HTTPTransport._connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/transport.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da601de0cc3e145fde27312a977c65833caafe35b93d7a017102d8f5bc2a80"}},{"ruleId":"D2","level":"warning","message":{"text":"score_fidelity.main (cognitive 17): score_fidelity.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (7 pts), error handling 1, ternaries 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":"evals/score_fidelity.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb17b1d849a03bb7b0522a8a3f9f76ed9a334668f92e5d2f1358e17594920b"}},{"ruleId":"D2","level":"warning","message":{"text":"compile.checkConformancePins (cognitive 17): compile.checkConformancePins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3, boolean chains 2, error handling 1, loops 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0344e048ff7c115f93011fe64a3a7572911796fe40b304b4ba509eaff7c160"}},{"ruleId":"D2","level":"warning","message":{"text":"probe-installed.which (cognitive 17): probe-installed.which has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/probe-installed.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a257a707f6fafe65e93d0ba494ee033a7b309d5fe6d909c23789802ef02129"}},{"ruleId":"D2","level":"warning","message":{"text":"apply.moduleStates (cognitive 17): apply.moduleStates has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 8 (nesting depth added 1). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 610, 618, 607). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"f113ae82f6bfd66f8fa0b4667bd48cdccca7219b0b64553e0d0794431cedfdc0"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.stepRows (cognitive 17): onboard.stepRows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (4 pts), loops 2, boolean chains 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10857f98f0908d694e635aaf1ff38bc128caf72a12707014e1940867651a89"}},{"ruleId":"D2","level":"warning","message":{"text":"learn-tui.renderLearnTui (cognitive 17): learn-tui.renderLearnTui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 2 (3 pts) (nesting depth added 2). 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":"packages/cli/src/learn-tui.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84ccc64f616cff651e04b28711b9715774d60936c1b2b112ea35b67c45abff7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.discoverSkillTargets (cognitive 17): index.discoverSkillTargets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"def6821faa4d629536bad68d7ada30b7706305d44ca8e28efe398bf1a9e65d45"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runExternalSkillAdd (cognitive 17): index.runExternalSkillAdd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 4, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 1). 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":"packages/cli/src/index.ts"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"674994a19b87c88a95fb0c8279a92d677afe65bd6711e801ef26589e23d43a25"}},{"ruleId":"D2","level":"warning","message":{"text":"index.removeAgentNativeBundle (cognitive 17): index.removeAgentNativeBundle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (4 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7307a1d15f358a0260a4e7b56f4e9d1bf115dd895cc623706533882a6591ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.applyWithDurableCli (cognitive 17): index.applyWithDurableCli has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 3 (4 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4118, 4132). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1caee621a52ccfe4f1d2eebec05fa2a099138f002017cd22861c7fe554211a7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.generatedInvocation (cognitive 17): index.generatedInvocation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed142ca4a88fe9c5bae8b221bf55b4ff5d622dfc84a118d47c51169df6c7bac7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.opencodeUnroutedActiveProvider (cognitive 17): index.opencodeUnroutedActiveProvider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (3 pts), loops 3, boolean chains 2, ternaries 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9724}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f769fac4c0cf6c6b3bb1954acd524567348fdc7983328efa8b8d223ca81bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.repairNativeAgent (cognitive 17): index.repairNativeAgent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 11536). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5821d43207ff8dae5c3244290f8e9dcba128e4ca165b582c19c6d10b4db006f8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.localScanUploadFromRetro (cognitive 17): index.localScanUploadFromRetro has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fc29400a4140e3cad40120e96db49c6a0655c8a15bb0177f6d896033c77f74"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncRequestSpan (cognitive 17): index.syncRequestSpan has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 6, ternaries 4 (5 pts) (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":13475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d52fccb2189a9216f3962a4af555a385f7940c1614cd24fa7b00b3d35d8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncLocalPracticeFindings (cognitive 17): index.syncLocalPracticeFindings has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), ternaries 5, error handling 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. 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":"packages/cli/src/index.ts"},"region":{"startLine":13695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e52db58a610935c020f44f21b314396e4e3d6a4309266f6acd6b8889e5b04f7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readLearnDiff (cognitive 17): index.readLearnDiff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89fb135678ded62c1e335bd35101cbb6cc7e6cf8a8a4845343d0f915c84743d"}},{"ruleId":"D2","level":"warning","message":{"text":"google.selected (cognitive 17): google.selected has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 73, 70). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1495e6e39a3cfd8ac206c9d8b13d2521edcc595fcd78eb17057f6b6a6e690b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-compat.unpreservedAttributionHeaders (cognitive 17): provider-compat.unpreservedAttributionHeaders has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, error handling 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae384ef437f216e282aa4dd1e900594024d5aac1727e2c51b7cb977a46b7dcbc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.isValidPolicyDoc (cognitive 17): index.isValidPolicyDoc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 pts) (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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad899a0b4dd4a6bef9acfeab2eccbc5c7817333e2b77149f224be09e164df9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.guardPasses (cognitive 17): index.guardPasses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88766e593578d0a6f9072d1795caa2235e770c490b0a3b0637568645dac88bb"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.createNodeTransport.fetch (cognitive 17): transport.createNodeTransport.fetch has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), loops 2 (3 pts), if/else 2, boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"packages/sdk/typescript/src/middleware/transport.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b22544bcb304205feaf93c7acf06bef5be35654c0ba7b30a013e80147ccb1"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.optimize (cognitive 17): MiddlewareRuntime.optimize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (6 pts), boolean chains 1, error handling 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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"12984806149130491c2ca4764516136c36ccecd0e28edc6806aeece108fb372a"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-stats.aggregateHistory (cognitive 17): caveman-stats.aggregateHistory has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), error handling 1 (2 pts), loops 1, ternaries 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/hooks/caveman-stats.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a547cb3346ff5737c1a3892892824098cd7bc6c3c0292576acb5af92260d1b5"}},{"ruleId":"D2","level":"warning","message":{"text":"spawn-options.resolveWindowsCommand (cognitive 17): spawn-options.resolveWindowsCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp-servers/caveman-shrink/spawn-options.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cd4e945119858019e524fcf94e3f97c4cd93cf0c7a613235e8f7c08f7c262e"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.applyModeChange (cognitive 17): plugin.applyModeChange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (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/plugins/opencode/plugin.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b8791618a5f5bf01124d11c9172fbe5f2de67366cc0bb23253b734b609d413"}},{"ruleId":"D2","level":"warning","message":{"text":"readModeLog (cognitive 17): readModeLog has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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/hooks/caveman-stats.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd9154cc1b29b9b0f7c573bb96c58adef44b0e234e5e0bf1cd7872ad98e59a"}},{"ruleId":"D2","level":"warning","message":{"text":"skillsRoot (cognitive 17): skillsRoot has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 2 (3 pts) (nesting depth added 1). 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":"installer/lib/provider-skills.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3983f0c8eb6d867661a493b31cdc3c8b61a5daede9fe8e2832b13c9fc3ace0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ccr.windowsACLGrantsBroadWrite (cognitive 16): ccr.windowsACLGrantsBroadWrite has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 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":"engine/ccr/sqlite_parent_security_windows.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6059d7f9ba173fb092aeb5b7dc3fe63377b059f517ae8e8077c001b5c5a54208"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.pruneDuplicateAXText (cognitive 16): compressors.pruneDuplicateAXText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), boolean chains 2 (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":"engine/compressors/axtree.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cf61e2861a546ea01112c3d279b6374f50e2e56e4095d52d837ec71436aa8d"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.expandSectionContext (cognitive 16): compressors.expandSectionContext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/config.go"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ae1078aae5d79f0d4ffd4a2d96fed0cac6dadd2f7873da09e81991e851cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.accumulateScores (cognitive 16): compressors.accumulateScores has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/html.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"30768be480eb4185e85855049f0448aea6c61e457c09843c31aef1e55b1a2338"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.primarySeries (cognitive 16): compressors.primarySeries has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 3 (5 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/json.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d789e4940f2223f40389424ef6194718b6a50b34ed35b97833211fa3e9d71395"}},{"ruleId":"D2","level":"warning","message":{"text":"compressors.splitTextSections (cognitive 16): compressors.splitTextSections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/text.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6078f04c83db984e5891bfbccf9da0405073496a75f6b01bbba9b3ed496c6ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"searchResultCompressor.compress (cognitive 16): searchResultCompressor.compress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, 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":"engine/compressors/searchresult.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"011e699cee2b1df9169bf4051c1308610e341adb88a09c0bb24abaae1cd6eb05"}},{"ruleId":"D2","level":"warning","message":{"text":"toolSchemaCompressor.compressSchema (cognitive 16): toolSchemaCompressor.compressSchema has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ea8302c692e7d3c30f6c309b796bf787eef8de081c97ab55e1f99ebfd88160"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.warmBody (cognitive 16): gateway.warmBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b1d46e35fa3ff8a00d8ceb3d09d6c0d8b437497959c9c972365703ed77198a"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.withAutoModel (cognitive 16): gateway.withAutoModel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe2d2f19711174015dc6df5b8832d97079790883fdd123451cdd1c2d810568"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.pairPrefix (cognitive 16): gateway.pairPrefix has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), loops 2 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d78bc577ced695bccd7226b70fbeffa93f3dcc55bdbb6d7a8ea703656ccb231"}},{"ruleId":"D2","level":"warning","message":{"text":"warmTable.load (cognitive 16): warmTable.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 pts) (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":"proxy/internal/gateway/cache_warm_table.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2e9fc2ffa5d2254d37a70f24b594f9cac63d66908d364e5d51fea9c8d7fa86"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionLedger.Observe (cognitive 16): sessionLedger.Observe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/ledger.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"80920e417e27ea41050034db8224e5522c5f68f6870b77310c4e0caf6a1c8e35"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.sendCacheWarm (cognitive 16): Server.sendCacheWarm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b4cb7f376ba86c394dc08392e11efac85a60b723b21187524e0f52ee5938ec"}},{"ruleId":"D2","level":"warning","message":{"text":"nativehook.preToolRequest (cognitive 16): nativehook.preToolRequest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (nesting depth added 10). 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":"proxy/internal/nativehook/hook.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ea41150349f7d52f8bc439421ecf3532002f058b14bea9dbb8c3433f2c993a"}},{"ruleId":"D2","level":"warning","message":{"text":"nativehook.configuredMode (cognitive 16): nativehook.configuredMode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39362b714ee70c9e08b016248b73bb701340ed774139629914c08f959e0ae9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.repositoryEvidenceContext (cognitive 16): Runtime.repositoryEvidenceContext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e478606b182ddcd5ef6b4fa16692af5fa1cf8c6ea206e909b683d1e124e11a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"store.configTurnsPerDay (cognitive 16): store.configTurnsPerDay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1, match/switch 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":"proxy/internal/store/learn.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1bb02593f4d45e997654b8d08318958d18bd69433dc53e17251f33d5321b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"store.buildLearnSpend (cognitive 16): store.buildLearnSpend has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_pricing.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c55cdf71fdc98d8c8dedb320c06154fe8dd36f4a8eaa4eba32d72264337ca16"}},{"ruleId":"D2","level":"warning","message":{"text":"store.claudeStructuredSkillReferences (cognitive 16): store.claudeStructuredSkillReferences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c885f0adcd2d43b38f1affbe1b0e44b90e48d2f312cc302d03fc95029d0b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"store.quotaEventsFromAny (cognitive 16): store.quotaEventsFromAny has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 434). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad96464560e0bcfbb26115e75a20fa9b2211c531e07eb90c059ed87885c5d7ee"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareTx.SaveOriginals (cognitive 16): MiddlewareTx.SaveOriginals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (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":"proxy/internal/store/middleware.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f031b5d0538f5253fcec611d191626e683572c1bf8f7c3c6ea8897353ee0fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"postgresMiddlewareTx.sweepable (cognitive 16): postgresMiddlewareTx.sweepable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (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":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc254400e9dd9f403c08db1527bb60307388f9d78020e4c10784ec0af61ba75a"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionEventConsumer.finish (cognitive 16): sessionEventConsumer.finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 1. 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":"proxy/internal/store/session_source.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4624ecb2ff377b69fa346f8499a45349abd4cf047e11e3cc499099694dd8428"}},{"ruleId":"D2","level":"warning","message":{"text":"codexSessionSource.scanSession (cognitive 16): codexSessionSource.scanSession has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_codex.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"217613a0c545f7ecaa32b0a0fa5623fa378ddfb6a52797cac4b0161d6efa9bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.writeExportSpans (cognitive 16): Store.writeExportSpans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc424779e229fc8c906680624b8fcf2b1a2f2e31806b57ece93f226849a4595"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.ObserveSummarySince (cognitive 16): Store.ObserveSummarySince has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/store.go"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d2fa54f8c7a6866a23a5f18e4eea035ac4fe5d965826fc2a5a3adb27bd8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.InsertQuotaEvents (cognitive 16): Store.InsertQuotaEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f174b00b45d6d60fb162c93f93ecfb98cbe209b5ce5d778e882eae9a0010693"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.topMember (cognitive 16): translate.topMember has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a9146a46e574dcfaf9b5dc76229388f06dd51e289ab5d7bda4bd8bc43e6c99"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.validText (cognitive 16): translate.validText has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/jsonfast.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8dc065d29d4c6ca649dfd3c265780de69f53f24cca67efefb6f506d6dd1d45"}},{"ruleId":"D2","level":"warning","message":{"text":"translate.relayContent (cognitive 16): translate.relayContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 1 (4 pts), loops 2 (3 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":"proxy/internal/translate/translate.go"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"8104f3bfb3a91b541616a0d623a8ea79f039bf6db55138403735a787e97a5f91"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.mergeProviderOutcomeQualifiers (cognitive 16): providers.mergeProviderOutcomeQualifiers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"831989094274de6a6b28f5507a3100676de4ca6abecf9f5254178fc6fcb2da37"}},{"ruleId":"D2","level":"warning","message":{"text":"bedrock.eventStreamErrorHeader (cognitive 16): bedrock.eventStreamErrorHeader has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ea03df21920bfccd6f578bc68188b7f961e84a225c8f015d3c125e3c72da0a"}},{"ruleId":"D2","level":"warning","message":{"text":"gemini.rewritableZones (cognitive 16): gemini.rewritableZones has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 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":"proxy/providers/gemini/content_compress.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e0647df0f9530296247fc3ebac0ae63365f64680c023c1eddf4b934a1bfd70"}},{"ruleId":"D2","level":"warning","message":{"text":"counttokens.decodeJSONObjectFields (cognitive 16): counttokens.decodeJSONObjectFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 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":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd33da2b5d238bd98e0fbc61b756a4164c92cc976e3191630b41331ebc957daa"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonsplice.AppendObjectFields (cognitive 16): jsonsplice.AppendObjectFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (nesting depth added 3). 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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4305a80601a8162acd6b330d0dbac38fac6f375705828cf1861744e367be6a50"}},{"ruleId":"D2","level":"warning","message":{"text":"Guard.Inspect (cognitive 16): Guard.Inspect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). 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":"shared/platform/cacheguard/cacheguard.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b132fc2a3aa568a2f850b27d21748b78738a6aa609fca649d1bf9e4832e9baed"}},{"ruleId":"D2","level":"warning","message":{"text":"Cave.compress (cognitive 16): Cave.compress has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6, boolean chains 5, if/else 4, error handling 1. 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f30a33f9c07fee91ae86d1e17f3137ca04f9eea30de41fa5007c0e9075e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.preflight (cognitive 16): MiddlewareRuntime.preflight has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, error handling 1, if/else 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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfb667f34453997c8573f42b07f3568ae7173242bd7cc24b38539ac5f946629"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard.confirm (cognitive 16): onboard.confirm has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5, boolean chains 3 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (a function literal at line 749, render, a function literal at line 757). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb9a420e447301193be95d8543fa5aa3c5bb9f6f0024b3ef02f12bcae28e41"}},{"ruleId":"D2","level":"warning","message":{"text":"stop.endRuntimes (cognitive 16): stop.endRuntimes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/stop.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e707529afdead5beed797371d26d1f67e6ccd3e3a42469615a2b495c63ba4898"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseProxyStatsPayload (cognitive 16): index.parseProxyStatsPayload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6053fba6e0b69e53a74ff5c7ce1e7958087b7aac0e7dfc7735e5947fc216a8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parsePixelRenderReport (cognitive 16): index.parsePixelRenderReport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8964f44b181b1c28d987a7ce6c1b735cffd42a1fd842cdf5b978b5165b1e3389"}},{"ruleId":"D2","level":"warning","message":{"text":"index.durableReplaceFileIfUnchanged (cognitive 16): index.durableReplaceFileIfUnchanged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (6 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":"packages/cli/src/index.ts"},"region":{"startLine":8641}}}],"partialFingerprints":{"codehealthFindingId/v1":"611d8ca2d90fbbe70a51607c14449feae131852e8c9c4b889dba46f75bcc8119"}},{"ruleId":"D2","level":"warning","message":{"text":"index.recoverPendingNativeInstallUnlocked (cognitive 16): index.recoverPendingNativeInstallUnlocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), error handling 2 (4 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d175ea4081ad0e8020927439f608a96b07594cc328825c8d80313d5c4595b93d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.readLocalScanState (cognitive 16): index.readLocalScanState has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 2, if/else 2, error handling 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":"packages/cli/src/index.ts"},"region":{"startLine":13252}}}],"partialFingerprints":{"codehealthFindingId/v1":"543661cb0f68c814963203c3b5012e99d35f912e6439275392ced5188956d5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncAfterLogin (cognitive 16): index.syncAfterLogin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 1 (nesting depth added 3). 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":"packages/cli/src/index.ts"},"region":{"startLine":13808}}}],"partialFingerprints":{"codehealthFindingId/v1":"154392f7a9f79aff7a1caca712401ea55e3b2bcdfae4fce8ebb503a5307f931a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.canonicalMcpConfigPath (cognitive 16): index.canonicalMcpConfigPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), error handling 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14992}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabbad0b945e3b602af2516e28af4aeefd09d6853c3c9453cf3ff97774095af4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.planMcpKiloJson (cognitive 16): index.planMcpKiloJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). 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":"packages/cli/src/index.ts"},"region":{"startLine":15072}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e60a80604f3459df10a2f1b705c978052d00e932e1a0c43980668720e79aeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.qwenEffectiveEnvValue (cognitive 16): index.qwenEffectiveEnvValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7943a947eb76fcab83d0411cc0df7cfabd59024c6ec6f1fcb804cadf7d6d09f3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.nativeRepositoryState (cognitive 16): index.nativeRepositoryState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 2, error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17740}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edc774d1bdcb5a68d142ae72497f8b1f3a86b0d43016fb94779899861b7a054"}},{"ruleId":"D2","level":"warning","message":{"text":"index.removeShrinkPluginOpenClaw (cognitive 16): index.removeShrinkPluginOpenClaw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19331}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e54d5b9b8ba988b04b12833ef90492fd30971ec88a37bd93c2ec115df6853c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.verifyChain (cognitive 16): index.verifyChain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b629a1f8f213687658d11441b6a3ffdf239ff7a8d1d839ec60bf2b42f7c930a5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.saveConfig (cognitive 16): index.saveConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. 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":"packages/cli/src/index.ts"},"region":{"startLine":22877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d82a37cba4ff4d101d237fbc008fa15ba73bf2dae27384b18616dcd7f41ccf3"}},{"ruleId":"D2","level":"warning","message":{"text":"native-hook-fast.repositoryState (cognitive 16): native-hook-fast.repositoryState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 2, error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9d1127b4a4bc4ece4bab9a095a71f24af4aa2d47d730f7b19883528adb20b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.acknowledge (cognitive 16): index.acknowledge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/device-auth/src/index.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70745b210b38d8ac52690633825c7e09b9bdccfabb578a8f632a50b16fe5cde"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.sanitizeHookResponse (cognitive 16): protocol.sanitizeHookResponse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/protocol.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60a92a01e62471d90eac6800450c0dbc8eaeccf80a2d74598d396ad5ae0be55"}},{"ruleId":"D2","level":"warning","message":{"text":"index.compress (cognitive 16): index.compress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 3, error handling 1. 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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2e2c76be1050234c4ff29bb66fbf6e10d0176cd8f08120393a37358467345"}},{"ruleId":"D2","level":"warning","message":{"text":"MiddlewareRuntime.#http (cognitive 16): MiddlewareRuntime.#http has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e826489607f650bce58b8d109feb0aa71a1a4b9dd75121a617e0f8078f5a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman-activate.activate (cognitive 16): caveman-activate.activate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1, ternaries 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/hooks/caveman-activate.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee60f535370e48630a67600028e077b62a3a6e308f9c2606306c3c4ed61dd8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.CavemanPlugin.chat.message (cognitive 16): plugin.CavemanPlugin.chat.message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"78871cab8e7e946c54bf5e2c901b481bc75f8caccbc687429e147a1797b984b3"}},{"ruleId":"D2","level":"warning","message":{"text":"gcSessionStore (cognitive 16): gcSessionStore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, error handling 2 (3 pts), loops 1, ternaries 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/hooks/caveman-config.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f195f11d8117ef2af00ef778ff088908b2c7e337579cab4473a96ad83bdb3f21"}},{"ruleId":"D2","level":"warning","message":{"text":"validateConfigStrings (cognitive 16): validateConfigStrings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, other 3, loops 1 (2 pts) (nesting depth added 3). 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":"agents/compile.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c768d1fc38fb24fbf74e02b6e5560d6d7e5f83d3f80577d52e6139118e9c332f"}},{"ruleId":"D2","level":"warning","message":{"text":"removeCavemanHooks (cognitive 16): removeCavemanHooks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 1 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"installer/lib/settings.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ba4684535bbd10134719919cfc25907aaac530c9a4fa0da0aff3dafbd6294a"}},{"ruleId":"D2","level":"warning","message":{"text":"CavemanPlugin.chat.message (cognitive 16): CavemanPlugin.chat.message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4c9fc155d225b63d3994d1230b0e7637b2ac70e98a27eddb8822bce6e6fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"startSink (cognitive 16): startSink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 4 (6 pts), boolean chains 2, error handling 1, other 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 332, 325, 329, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/sink.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f692d5c6481b84ec815d19c3eb264c81496b71749fe67554752a460fd61f4d38"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveWindowsCommand (cognitive 16): resolveWindowsCommand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (4 pts), loops 2 (3 pts), other 2, boolean chains 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/process-tree.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"34171ecb006b011c20f431715a193533528222aacc81a71eb0e7773298268c65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 15926 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15426 over it, 31.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":"packages/cli/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9716d4c41050e9aad585d44116c4183998b708d92b6ba77413650580387aa5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.proxy: MethodTooLong \u2014 proxy runs 587 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 487 over it, 5.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f54034e753d4a23067c1272dfc19aa2d23a7cd71c1b856adea03c99e7d9451"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: installer/install.js: FileTooLong \u2014 1866 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1366 over it, 3.73\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":"installer/install.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136cac0df2c4b93a42034793588b53fc071d7188101c3a78bf6d61e9a06a889"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caveman_cloud/core.py: FileTooLong \u2014 1702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1202 over it, 3.40\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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb43a847c6a3f5f0a9adb509b8df1cdc71ed0aa55177be6028802516054851f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: install.uninstall: FunctionTooLong \u2014 uninstall runs 318 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 218 over it, 3.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"423afe8cc05cbfe9f840c0676c6eece1bda16b00b92239c66189218cf777bc36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 91 methods, declared across 19 files: store/trial_store.go (17), store/learn.go (16), store/store.go (13), store/middleware.go (8), \u002B15 more file(s). The bar is 30 methods; this is 61 over it, 3.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/store.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"020b21538d4091c8698dbee9878410e369871d0472470fe1abbbb38efbc97f90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 1481 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 981 over it, 2.96\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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e99d088268d3cc70a1b6ec4c6e47d573ce687d1095342969f2bf410e1bbc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/proxy.go: FileTooLong \u2014 1461 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: Server (11 blocks, 41-2364). The bar is 500 significant lines; this is 961 over it, 2.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26792afed1311b33e055063974d4f812d5dcc33665cfbd150342658a13b8a32"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RequestRecord: TooManyFields \u2014 78 stored fields. The bar is 30 stored fields; this is 48 over it, 2.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/server.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac25e5ed6c944a7f3fdca37a1892058a1f4132b244e0bd4cb948b63c02515f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.chatgpt: MethodTooLong \u2014 chatgpt runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3721795c38f9e66b8b5326e448e9422a2253fec784d91edaab196a88eec3522e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/adapter.go: FileTooLong \u2014 1091 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 591 over it, 2.18\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":"proxy/providers/adapter.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d47a4cebc66f2f8ab30f890ed5217a49195daf4d22af33c60620ac7ab2ad80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Server: TooManyMethods \u2014 61 methods, declared across 17 files: gateway/proxy.go (11), gateway/server.go (10), gateway/raw_pin.go (7), gateway/breakpoint_plan.go (4), \u002B13 more file(s). The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/server.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc408914ccd0d5019a940019d0f4bf74187d98de245701eb852d154fff0b471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nativeruntime/runtime.go: FileTooLong \u2014 972 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: Runtime (24 blocks, 103-1420). The bar is 500 significant lines; this is 472 over it, 1.94\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f491f3ed67e50bfd992bf7f4712798eda8ca11150645d942d2def15551d625a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloudlink/link.go: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 463 over it, 1.93\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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcbfa322e8fd46c021fc35e4ce0e7f48b5c952f3f07a260ad0077f0390cab42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/route.go: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 423 over it, 1.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":"proxy/internal/gateway/route.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dd6e616332af677785f095aa6a19fe2561b3dc81106a1c7ee2e474a5d89b44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caveman-proxy/main.go: FileTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 411 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd47d85a8a6c2c207a123ceff7960ecf08cd698da8fbdce32c91ff60464ea665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/learn.go: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 405 over it, 1.81\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":"proxy/internal/store/learn.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a10377961420779779d0072631933b5a5e66207a7e45fded672385a2058ad7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Runtime: ClassTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods, 24 blocks, lines 103-1420. The bar is 400 significant lines; this is 292 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"192b569992954976b9ce912226b4551db87264467ff43421701307dbf4e0663e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/compress.py: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 355 over it, 1.71\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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ace161babf9b8b99d6ec0746b00d1854469a746b1568dddd94f0f13d34e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/compress.py: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 355 over it, 1.71\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":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f377d644f0b9fce43ca081e3f26f146976f1725008097dd6e0f9b86ac08a70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.BuildStatsReport: MethodTooLong \u2014 BuildStatsReport runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/stats.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5730dda82952f5c11a54314a0f58443fbc45c4c6ca888cfc3b7128c143d60503"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.chatGPTAuto: MethodTooLong \u2014 chatGPTAuto runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2589be7dbdbd194112cebe357079dec048aeb49531941218eafd358b9f7606df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 48 methods, declared across 4 files: ccr/store_sqlite.go (21), ccr/store_generation.go (12), ccr/store_integrity.go (9), ccr/store_reclaim.go (6). The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa4074ee47cb04b0169d83de5871154f2ab20fb72af44145781c6d7e951819"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: install.installOpencode: FunctionTooLong \u2014 installOpencode runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b7217ce8e7d3a6a35db16d9d26d98505bb6acd9c1f577f5c4158dde98a80aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.rewriteRequest: MethodTooLong \u2014 rewriteRequest runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b018377d643cc1e49f2e7f8dcb4a83eda4cac92dc4c512a2d9f830ecd545c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.runServe: FunctionTooLong \u2014 runServe runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d1aa8b77d1d862296c627c7e4b20fc5ae491950cd941c07ffb1b15ea26b86f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ccr/store_sqlite.go: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 241 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":"engine/ccr/store_sqlite.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9f9e022367227e4c840ab67bb2e2188b97457e3a22f49c6e9094605d9fb09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runtime.writeReceipt: MethodTooLong \u2014 writeReceipt runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/receipt.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e7a30dfe440e3807df6e30ae0a99129ebfbdba6f4b3f692e3f6c2788b495b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/runtime.py: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 235 over it, 1.47\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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50ed9073e9e8be99963674e06fdb1599c4bbf030f2730931a17251827e43329"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/translate.go: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 216 over it, 1.43\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":"proxy/internal/translate/translate.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b11765a3051317b0afd8d885d6b3562999554d2f09dff8c314a83aaa34135c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caveman_middleware/llama_index.py: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 209 over it, 1.42\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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe43ad54e117d6afbfe9c8094b24adcc27c5e63f929f2b7d9afa11bf7ec24fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.default: FunctionTooLong \u2014 default runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0f823691cc65110d9297d85c7a051eedfce0ed269742690aa451c77348200f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compressors.summarizeElided: FunctionTooLong \u2014 summarizeElided runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/invariants.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6cd1e3e4d6bb1522ae16f528db3d0c672b8f17df4e3f6378299f9dcbaa6f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: onboard.onboard: FunctionTooLong \u2014 onboard runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb01dc00415bef63da52943fcb76f359bd68c84ada6e812511df28372f01ace"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.record: MethodTooLong \u2014 record runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba77ef971d06f665fc6427a75e43d1cddc8fcc66c535d19b3f73cd993ae6eca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mastra.createProcessor: FunctionTooLong \u2014 createProcessor runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ac16c65b88a112c7443d2efc7cc25f763d0c1b9d52c2936d106382684782c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Link: TooManyFields \u2014 38 stored fields beside 32 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa1a196ddc252d66de8b1c1e8c3b64c6a382a420108cb205cf1613e8d9389b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runtime.ServeHTTP: MethodTooLong \u2014 ServeHTTP runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/http.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0921404cc44e35a6398d02f536ade0a3e8d11ed76bdcce1398c43fdbfc75003d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/onboard.ts: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 111 over it, 1.22\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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"213a2c46f1995908fb4566cafc6407860cb74b868c39b18a50d4bcfea25fb8d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: run.measureHarness: FunctionTooLong \u2014 measureHarness runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5f1fe05a0ad7974d90b4f5ec6825a81a58e0afa8d173421d85fb28ff25c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/messages_in.go: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c946b44381fc1ac55626266922965e631debcc3ac4de832e54fd4d089c7b87aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.buildLearnPlan: MethodTooLong \u2014 buildLearnPlan runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c261ca573d127890ab1b8cc13d0d235b60c46d07e84d9920458b4431658179d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Server: TooManyFields \u2014 35 stored fields beside 61 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/server.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8570fba5c90331ad5336f6780e9a1e2cb9c2fb41f8d71653f1dc5c618d895e19"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MiddlewareRuntime: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc169b3011c2201d466473c3432264d2ce36ea04c95e99bfc4c06ba44ca71b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: install.installHooks: FunctionTooLong \u2014 installHooks runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a66c7a998ee977d77c77a304562208c9b4be42cfff9fef02085be5b6b2af6a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CavemanLiteLLM: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/litellm.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65b095218ef166de90aa5258cf4f362e9661dfb2d91154211ed6195930a1a16"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CavemanLLM: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af4e527a90bbade6481d0ea6a460548af610a79cd283fcc2cb698a9b9dc9275"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/chatgpt.go: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56068e270838aa95a29ba66006757bc475ea507c134981a3ab32abe83318210"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/report.go: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0251608c946aea6ffa20b0383b4cbedcafd02a9e83f27003061f2ecd56dafe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/responses_stream.go: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef891063012276aa8217d7af6c0c58516088fca0dc1e4964cda12563ba315807"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repointel/index.go: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\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":"proxy/internal/repointel/index.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cad5e2cc0019a486360d66dce354445f82580b44edcebe77afb05cde30b164d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/store.go: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 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":"proxy/internal/store/store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4ec795524edf8f3b52d69126658adf4420eb126983617bd22a8aae858b7f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: translate.chatResponsesBody: FunctionTooLong \u2014 chatResponsesBody runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d2f580d21fd58ff5defb92319bd33b674d77f4363aa18427641fa50726de27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.assemble: FunctionTooLong \u2014 assemble runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"73560bb661d7e1c9ad71c0f55d754910d8de6301881e4fdd70748f3481563f14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: caveman-mode-tracker.handle: FunctionTooLong \u2014 handle runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af272fe765c241694bd1cfe957c1abf66ed37b679fbbd52f9a6f95e174c66bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Link: TooManyMethods \u2014 32 methods, declared across 3 files: cloudlink/link.go (22), cloudlink/events.go (5), cloudlink/warm.go (5). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d44c6da526ca1437499faa6ae262e30fd8cea3a915e6c6dacc4ddad0e2b2590"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StatsMetrics: TooManyFields \u2014 32 stored fields beside 1 method. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/stats.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe558c5b6446149b4e9f6008b02f124b40ec9494a469016f5d9843070dcf338"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/trial_store.go: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: Store (17 blocks, 43-719). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de45f62d30a6a9056299244b0c2dae3554401bf6a793f9493c8b7dea85a5327"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caveman-engine/main.go: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f37368060ae143cbcde1cd53cf2dfdc8d7ffa6f2c2720f744e3efcb805988a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AgentEvidence: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/store.go"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"03af14ab86b9504299bda1711cec48fefb346e21587773b021f78d97e4cc8acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.runLearn: FunctionTooLong \u2014 runLearn runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22f5db2746e7dc9fa264af60ccfab2b49290d13d47558e0f7526902b3b65da4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: translate.streamChatToResponses: FunctionTooLong \u2014 streamChatToResponses runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79bb3600aa6de76640f177cd5de352461448061ffaeca55f66cdf3aa3e53dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/runtime.ts: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: MiddlewareRuntime (149-685). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4746a75471b465b73ea792863275da0c95a0b970ad74fe8f8ec70191230e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MiddlewareRuntime: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b37e454f9ad8b29eb828242887dcbe664f3f5dbe472119426210528326748"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runtime.respond: MethodTooLong \u2014 respond runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8896f444db0b9eab9391f818e3ab23b01e52cf0395ccce604f5bbd1efaabf9b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/responses_in.go: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01\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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af94412aac564ca7ad19a79ceb259d6f98f62fe31cf01d6e9c67396a68eed3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): proxy/providers/anthropic/cache_breakpoints.go:86-139 | proxy/providers/bedrock/cache_points.go:211-260 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96a9534b5c65c366eb2aab0631c01c53e2da53b43f014845a1db449137310bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): proxy/internal/gateway/metadata_route.go:55-104 | proxy/internal/gateway/oauth_token_route.go:42-88 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/metadata_route.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3bdff60bc8b4f6d9ee32a241db5d5404331dfcfb0c60fd58a93e313aed81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 50\u002B corresponding lines): proxy/internal/store/source_claude.go:45-94 | proxy/internal/store/source_codex.go:37-101 | proxy/internal/store/source_pi.go:68-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 50 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96aeb39da3dc17982f53cb0a1dbcfba208a7b2951fb93218d814ccfc444ac28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): proxy/providers/jsonsplice/jsonsplice.go:158-201 | proxy/providers/jsonsplice/jsonsplice.go:205-242 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf61258167b02957608f602a90d2d11e13e9dbf41148788bf0ba8333da19867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): engine/compressors/searchresult.go:44-87 | engine/compressors/text.go:47-94 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/searchresult.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ba3925b5a54528128bf2e51922618c7d51bd2ac2b5908ebce36825341b425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/middleware/python/caveman_middleware/google.py:498-522 | packages/middleware/python/caveman_middleware/google.py:537-561 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3aadcb0e6435f0de5653c9e5c0e7f27aeac45b164c95bd61c87a394fab8214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): proxy/internal/store/source_opencode.go:153-186 | proxy/internal/store/source_opencode.go:188-225 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a04ff1493e31e72f412ab9bf410513fca31168e03caa9141187c1548e9209a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): proxy/internal/gateway/retrieve_tool.go:161-201 | proxy/providers/jsonsplice/jsonsplice.go:35-67 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"de38d72eb3455e95a827c73b8353e3ede9a65890c34eba59cf0450c7780b8b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): proxy/providers/anthropic/cache_breakpoints.go:26-84 | proxy/providers/bedrock/cache_points.go:34-83 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2e55f4b7f5b3af6c6a2e3288b20be3c102f956f769367f21e18ac8ba8eb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): packages/middleware/python/caveman_middleware/llama_index.py:581-612 | packages/middleware/python/caveman_middleware/llama_index.py:615-646 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"96166e743043ad372a47cd3c2b470cb998beba1fc3d260db21585cad1fa57388"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): proxy/providers/anthropic/splice.go:213-245 | proxy/providers/jsonsplice/jsonsplice.go:108-137 | proxy/providers/openai/content_compress.go:642-674 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"586beb3b07ec6a00277653fb688f0c30631815f3a0485071d3f140b973f974b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 47\u002B corresponding lines): proxy/internal/gateway/retrieve_tool.go:227-273 | proxy/providers/anthropic/splice.go:103-149 | proxy/providers/openai/content_compress.go:545-591 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 47 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1330b85d07b78cb436ab09779ed5094c9c2de804619611654284aaee67b950f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): proxy/providers/anthropic/content_compress.go:271-302 | proxy/providers/openai/content_compress.go:275-307 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6a9e53c8b8b3279c25989d6e8320fa68aba7b336ce72dd415ef4505adc4716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): packages/middleware/python/caveman_middleware/agno.py:443-474 | packages/middleware/python/caveman_middleware/agno.py:477-508 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6639171ba01198a82e91d9d5a343d5fdf2b794ee0553112b405849db596e4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): proxy/internal/store/trial_store.go:328-364 | proxy/internal/store/trial_store.go:366-392 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e02efe88f60e12d7c97816ca511ab5242ab33be60ac2ff2bb635672586d7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): mem/cmd/cavemem/main.go:260-288 | mem/cmd/cavemem/main.go:342-375 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/cmd/cavemem/main.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ab9453bb614916b71c32568ececdca02023fd3198155cad4a986ed32920280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/compressors/toolschema_annotations.go:322-355 | proxy/providers/jsonsplice/jsonsplice.go:244-278 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96adbc634c463ffc942a7eb76e852ffa581f12da15f1f852af2690a296a7367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): proxy/internal/store/source_codex.go:122-147 | proxy/internal/store/source_gemini.go:110-130 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_codex.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f1cf91e91c15f05765ccd6445081f7b3984061448ba1c8b512147eaa9fce27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): proxy/internal/translate/chat_in.go:254-283 | proxy/internal/translate/messages_in.go:340-363 | proxy/internal/translate/messages_in.go:686-708 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e27ebafe1e85743cf9087c71bd2a22ba9a5a58348e6f192af983e6c9dbee6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): proxy/internal/store/learn_loops.go:118-150 | proxy/internal/store/source_claude.go:268-294 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_loops.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2881b2e294914d7d0d57e20aa0512358ee6b01e38c86d915e946b36ec788c64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): packages/middleware/python/caveman_middleware/crewai.py:289-303 | packages/middleware/python/caveman_middleware/crewai.py:306-324 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/crewai.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"635affae7300d32377157cec6e70634ca25db2e2f10d513689ddcc08eedfaad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): proxy/internal/store/usage_import.go:31-62 | proxy/internal/store/usage_import.go:64-89 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1798d49707c2a8e62baef6ad80de7c93330f0fa888511e645c33f312309099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): proxy/providers/gemini/content_compress.go:68-84 | proxy/providers/openai/content_compress.go:92-111 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/gemini/content_compress.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bef22799c6b9f3ae967877d5898370d0ee60ce4a24fda397f2b9e1ac84d4f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): proxy/internal/store/source_claude.go:20-43 | proxy/internal/store/source_gemini.go:20-46 | proxy/internal/store/source_opencode.go:21-49 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8282fefba91537b843d3f20aae3f14c83580a433f069bbb535a305f4e75b37c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): proxy/providers/anthropic/content_compress.go:133-156 | proxy/providers/gemini/content_compress.go:33-52 | proxy/providers/openai/content_compress.go:47-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b268983654e6f53e4c4710b0e1d89c762703853b05581ad500a704f695618e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): proxy/providers/openai/content_compress.go:317-344 | proxy/providers/openai/content_compress.go:395-426 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/content_compress.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1953745893846badb48724edb890406a4ee465cc151c239832322387badd96fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): packages/middleware/python/caveman_middleware/llama_index.py:544-559 | packages/middleware/python/caveman_middleware/llama_index.py:562-577 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7761f83549ae5f9d49c5c1513ba3e85bb816328804f317215754c2007031e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): packages/middleware/python/caveman_middleware/anthropic.py:101-117 | packages/middleware/python/caveman_middleware/anthropic.py:120-139 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/anthropic.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"601504b94a55e41b37e2382c37a3f6fa774628bf711920bbad8ce86847afcb08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): proxy/internal/gateway/pixel.go:538-556 | proxy/internal/gateway/pixel.go:558-574 | proxy/internal/gateway/pixel.go:576-591 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/pixel.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf034ac1d91461e49c5c730ee27abf517a9b7b018dbf6537d13a4409a256a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): engine/ccr/store_sqlite.go:569-592 | engine/ccr/store_sqlite.go:594-621 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5470c3af6333de133a5f695b11607cb6dbd8bac6d6d611300c31ec682bc9d092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): proxy/internal/gateway/retrieve_tool.go:203-225 | proxy/providers/jsonsplice/jsonsplice.go:69-87 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7b2822b1eb05b44d4e963437e8cb40d52a7ae11fbd3319c62efe661f5301bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): proxy/providers/adapter.go:1665-1693 | proxy/providers/bedrock/usage.go:545-573 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"e344056bbcd3a237d77364e33899e4af4427267d252a33ec28ede1d27f8eff17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): proxy/internal/store/middleware.go:740-773 | proxy/internal/store/middleware_postgres.go:503-535 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"06551502b3438c77dd90ca8a418b338f7d663a9852ef4b6d91a65b50e69c5165"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): packages/middleware/python/caveman_middleware/_streams.py:38-69 | packages/middleware/python/caveman_middleware/strands.py:125-152 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_streams.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c9a494b03808c25b6a9d6c2784c1104cf534649a01fbcd97e70ea844f629a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): proxy/providers/anthropic/frozen.go:48-70 | proxy/providers/anthropic/frozen.go:84-105 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ae9483ea5a3c7ee020b6ea4a56e62d0065cdabedbc17b3f2cccac098dbffa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): proxy/internal/store/report.go:80-96 | proxy/internal/store/report.go:98-114 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bd701597691f5ceac56d2c58f31367c1a3542c7d88a8c0edcc60f2bed9d250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): proxy/internal/store/middleware_postgres.go:435-453 | proxy/internal/store/middleware_postgres.go:690-712 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c06fc8cba858703f1bec1eb5c514d0c4c455ce03b0b318ef3940a62b30e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): packages/middleware/python/caveman_middleware/agno.py:399-416 | packages/middleware/python/caveman_middleware/agno.py:419-440 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c2875a98c4e1bf288fb0a4114ca44d31d4914167ab8438aceb411ccf5ac2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): packages/middleware/python/caveman_middleware/llama_index.py:489-504 | packages/middleware/python/caveman_middleware/llama_index.py:507-526 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c19fc10bef7916026be1dea96ed4b2ee0dd97add8bc44d48c1e30de928fe3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): proxy/providers/adapter.go:1721-1738 | proxy/providers/bedrock/usage.go:611-626 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b7c54176bdb010f32f056a28a93f5b083f3defeba349c680547577a443f8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): engine/ccr/store_integrity.go:35-59 | proxy/internal/store/learn_experiment.go:188-214 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_integrity.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1dd5ce320c2f5ef95e3ca3cfa1d0c3882a2c6d757f116cb8cb74af03f2b1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): packages/middleware/python/caveman_middleware/autogen.py:307-328 | packages/middleware/python/caveman_middleware/pydantic_ai.py:284-303 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cd216bced617e41f6b8e8af49e5b30d0b65abc2deeaba4b4acbbf5c5eabf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): packages/middleware/python/caveman_middleware/langchain.py:241-255 | packages/middleware/python/caveman_middleware/langchain.py:258-275 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fa85476f0e3ea82807a9f3c172c93b5645509d816dd7b8100d0790fbc3970b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): browse/cmd/caveman-browse/main.go:106-126 | mcp/cmd/caveman-mcp/main.go:71-91 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ae1aef999e9687937cf36d3bd66c50e93140ad6dd63cca753c54a41252707e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): proxy/internal/gateway/proxy.go:1879-1894 | proxy/internal/gateway/raw_pin.go:243-261 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c0e07deed9b353b83dadd9899e43fe99ca356b349600bdfc876c70e07651da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/ccr/store_sqlite.go:1161-1180 | engine/ccr/store_sqlite.go:1182-1201 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"157afbcab861869ab266e38bc81b6210ff8be5f6452b72b91d908f84a10e84f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/ccr/store_sqlite.go:874-894 | engine/ccr/store_sqlite.go:898-914 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb52e697a351f1cdb7fa80144676c42d2bdd9fce5741caf058a55a5e7b887250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): proxy/internal/translate/messages_in.go:524-538 | proxy/internal/translate/messages_in.go:808-824 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2e7aeacdeef88a37fd248a69946639c0bc4353b7c2355bf186a00013b60c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): proxy/internal/store/recurring.go:250-272 | proxy/internal/store/source_claude.go:212-236 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/recurring.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f02060aaa5a039599071cb2920f54d3324fe6c5012a176f08a0352f5408013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): packages/middleware/python/caveman_middleware/agno.py:312-329 | packages/middleware/python/caveman_middleware/agno.py:332-350 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399546b538eab53bb629df0202158bdafb64bbd2c06c8e2598e54fca2a604dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): packages/middleware/python/caveman_middleware/langchain.py:136-147 | packages/middleware/python/caveman_middleware/langchain.py:150-160 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760eb8b8439c1199d4a0386e73c27ff31c5b2cfbfc8e69400bd1d4708283c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): proxy/internal/store/source_claude.go:101-121 | proxy/internal/store/source_claude.go:125-142 | proxy/internal/store/source_opencode.go:272-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb8406222790bdd8a4e5136d9e262aae0d70b34cd1289c014a9d7f66fde4b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): proxy/internal/store/source_pi.go:158-174 | proxy/internal/store/source_pi.go:176-198 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_pi.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4257eb69cef50f7c81ae5584a1d6c9c083e65fca967bde07e1076fc22f759778"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/middleware/python/caveman_middleware/agno.py:361-371 | packages/middleware/python/caveman_middleware/agno.py:374-383 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2654056160b07a753772b7817fd054ebcf9d2feab8e9186c1f7ea0963ae5d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/compressors/json.go:83-106 | engine/compressors/toolschema.go:91-106 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/json.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7751a8dc0b191582370440f0db4bb6aa6357529b4e19b9799133c244501a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): packages/middleware/python/caveman_middleware/llama_index.py:804-815 | packages/middleware/python/caveman_middleware/llama_index.py:818-829 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bff06195edc296fbad87d7ab7c69af8cd381175c9402ac0bd0224c518826079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): packages/middleware/python/caveman_middleware/agno.py:85-95 | packages/middleware/python/caveman_middleware/langchain.py:82-92 | packages/middleware/python/caveman_middleware/llama_index.py:275-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"806db010fac57fd417a3c39517ac0ae3cf1affbe4b37a430eabecf4b55e39602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): proxy/internal/gateway/route_cache.go:50-64 | proxy/internal/gateway/route_cache.go:85-102 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ee3be9638ae37e415031eaa067eda6e179bd84c2b4e49340e4d402365284b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): proxy/providers/adapter.go:1991-2009 | proxy/providers/bedrock/usage.go:383-405 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"162ccdc013abfe69cef525ee89128499365e2a3ec23b62fb433e275f7c5956b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/ccr/store_wasm.go:77-92 | engine/ccr/store_wasm.go:96-110 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_wasm.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001fc040c2aed2e59b5feefb34df1f3fd574f7b72b9a0b1542eb277fefbf1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): proxy/internal/store/middleware.go:899-912 | proxy/internal/store/middleware_postgres.go:670-686 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8ed9833dabf9fb66eff4a3ecf4998751382e474857177c7298adf472ff6a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): mem/cmd/cavemem/main.go:202-218 | mem/cmd/cavemem/main.go:226-236 | mem/cmd/cavemem/main.go:244-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/cmd/cavemem/main.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"28604497cb4d838017e221433bdc4f1a0817c01d3d8ed4ef13795dcac88f3d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): proxy/internal/translate/messages_in.go:311-322 | proxy/internal/translate/messages_in.go:655-666 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"02583898f6dfa62544c1f0174a50201e221081a1a1cfeedc5756e2de6122f679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): packages/middleware/python/caveman_middleware/autogen.py:227-232 | packages/middleware/python/caveman_middleware/pydantic_ai.py:225-230 | packages/middleware/python/caveman_middleware/strands.py:58-63 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c1552d2bffc45bd750b18e7348e993594852e5ad637f33f5e7c99a2ab063f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): proxy/internal/store/middleware.go:639-654 | proxy/internal/store/middleware_originals.go:17-31 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f178fb899e657543c8845774d00c750967efb8cf7a9d9d4a153ffa245c03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): shared/platform/catalog/catalog.go:152-167 | shared/platform/catalog/catalog.go:172-183 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/catalog/catalog.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5997f1afad3c03ec40d1a1eea31d09fad06b6a5f1b464e89891993f7c14b3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): proxy/internal/cloudlink/link.go:484-495 | proxy/internal/pool/pool.go:496-504 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afaa4cdaa4ba7fa47adbe16959107a4cea083cf5cc8323dc26eebe52ba7f957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): proxy/internal/gateway/prefix_monitor.go:333-343 | shared/platform/cacheguard/cacheguard.go:73-83 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6617a0f7705d1f44781cdb1352d4141ae3b435ab667b67c489cf4e0832575e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): proxy/internal/store/middleware.go:544-560 | proxy/internal/store/middleware_postgres.go:317-333 | proxy/internal/store/store.go:1149-1167 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba608bcbfc058ccf8274f4dc8f5c8a61973930d4860e79a19d4f3ae3cb728a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): packages/middleware/python/caveman_middleware/google.py:133-148 | packages/middleware/python/caveman_middleware/google.py:152-167 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d23309fd7f731a01881244152ffb151cefaaafe38eaae392f907fcc6637fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packages/middleware/python/caveman_middleware/langchain.py:402-409 | packages/middleware/python/caveman_middleware/langchain.py:412-419 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b7669528b7bdfd490484b32d90a0c34f89c6201ab173d45d4cd9a67683e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): engine/ccr/store_reclaim.go:325-340 | mem/store.go:621-636 | proxy/internal/store/middleware.go:882-897 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_reclaim.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"477ff401c98c8d955f10d759b89e55280ffd6ab80007ae66cb2f23503acd3d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/middleware/python/caveman_middleware/_native.py:348-354 | packages/middleware/python/caveman_middleware/_native.py:357-363 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"643f2f31678491af46be3702cbab9f4ca92efcfc5b40a4df0f1e8d0cfcb803d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): proxy/providers/anthropic/content_compress.go:368-378 | proxy/providers/openai/content_compress.go:428-438 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde99e936236ff8cbfc01bc44795f899923fa984730160a0c2aebf32884acee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): proxy/internal/store/middleware.go:725-736 | proxy/internal/store/middleware_postgres.go:488-500 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1169b7d022eb55da1cd7c88308076d74185f98d0e59b0ecb1cb74555037acce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): proxy/internal/gateway/proxy.go:1199-1211 | proxy/internal/store/store.go:1194-1205 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cf712c4d37bdff107367a1a8f258daa4d496d7cafe9687c172bc68991bc5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): proxy/providers/azureopenai/azure_routing.go:108-119 | proxy/providers/vertex/routing.go:191-204 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/azureopenai/azure_routing.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"01958bc22f9f9214d008ebefdb83efdd795ea7e4f1148a633bc64d466cb88440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/compressors/html.go:231-244 | engine/compressors/html.go:248-262 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/html.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac29318cd78069e39565d5285293e2bf68c59db4049ef209bcb2ef2aa21dbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/ccr/store_sqlite.go:633-645 | engine/ccr/store_sqlite.go:922-931 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e532c453d32882f17e488d87b3501cc74894607333c1409f2aa5a19e7e28b5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): proxy/internal/translate/chat_in.go:51-61 | proxy/internal/translate/messages_in.go:100-112 | proxy/internal/translate/responses_in.go:87-97 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4331b0a2a1d5eeac965cda3c87785964a540e74d8c5a223b37d3d29523e254c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): proxy/providers/anthropic/cache_breakpoints.go:141-157 | proxy/providers/bedrock/cache_points.go:146-162 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82d4ef654af77c1ec0094a77ce1ed0f88a4a670f52054f12c0f05e49f97958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): browse/cmd/caveman-browse/main.go:80-90 | engine/cmd/caveman-engine/main.go:49-59 | mem/cmd/cavemem/main.go:42-57 | shrink/cmd/caveman-shrink/main.go:32-42 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f7d7e5f49088bb3722ce37e661fd9a831d33095015e46338e0a1810f9a095d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/detect.go:213-226 | engine/detect.go:228-240 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/detect.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4e9675bdef69fcc87c27e8ee91f1854d99e4f0bb70e216952c4c5e997c4c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/ccr/store_wasm.go:145-158 | engine/ccr/store_wasm.go:160-173 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_wasm.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e246fb71f478ae55bf7378c3257a35fb544b08bb5567bb0afae77967cf7ff02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): proxy/internal/store/source_opencode.go:227-242 | proxy/internal/store/source_opencode.go:244-256 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc0279a075c6599a3dbdf9b36d40ac9894ac727b49dffb42b4b64fe45f54cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packages/sdk/python/caveman_cloud/core.py:949-956 | packages/sdk/python/caveman_cloud/core.py:1265-1276 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78ce61b4235f91b879490b6a72d673cd6e8497a711e1f19d7b22f3d3582d189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): plugins/caveman/skills/caveman-compress/scripts/benchmark.py:38-41 | skills/caveman-compress/scripts/benchmark.py:38-41 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/benchmark.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc4b71e8081d6cf90d23e96ccbef67cc3f53e2112a7e0442a9f5fdf499d140b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/image/tokens.go:316-333 | engine/image/tokens.go:335-352 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/tokens.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffef9c512cc19fe93a164892822be445f01b04a92800b1f05729770ee0c9b24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): proxy/internal/middleware/validate.go:8-18 | proxy/providers/bedrock/routing.go:476-491 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/middleware/validate.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9857965572a0b5762b013bbeb5004e5c9ae3a344bbce8d8316da9b0b601abfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): proxy/internal/standalone/standalone.go:443-450 | proxy/internal/standalone/standalone.go:455-462 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/standalone/standalone.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb83079e35169c1cc3bbed3ee0eb411880c9244dd9cebe0a02d11c70a8d9ed3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): proxy/internal/store/config_scan.go:62-74 | proxy/internal/store/config_scan.go:76-88 | proxy/internal/store/config_scan.go:114-126 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea5f29167d226e0673220d0a3a3e88fe233b3da74a331fe128b0adf619163f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/retrieve_query.go:37-49 | proxy/internal/middleware/recovery.go:126-137 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/retrieve_query.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9ddde80bb411db1402ab0bed0e944b24c086e2d88da5ed07abfa3a4ba89104"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): proxy/internal/translate/chat_in.go:219-227 | proxy/internal/translate/responses_in.go:101-113 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849ade618d32c3e0b4ba62fea4d640b66aac772c4112dfc987815854053f814"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): proxy/internal/store/learn_experiment.go:239-249 | proxy/internal/store/learn_reconcile.go:183-193 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a4b8107957c2b19bc40b9993835db4f95129adee6a79dfdc07f46a6bdd70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): proxy/internal/store/middleware.go:587-592 | proxy/internal/store/middleware_postgres.go:361-366 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dcfeaba49f466b84d658fe96ff70a5eb0afaf886d70c15433ff25d2f15f217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): proxy/internal/store/middleware.go:608-616 | proxy/internal/store/middleware_postgres.go:413-421 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08076aa69421de1e7e961ff0cdb258dfda297bc10207d7512e3abe6716cc6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): proxy/internal/store/middleware.go:659-668 | proxy/internal/store/middleware_originals.go:33-42 | proxy/internal/store/middleware_originals.go:47-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb80510f4cc9765c0d4fabd0d7388b922acdf42e024749880b96eec2690e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): engine/compressors/json.go:291-299 | engine/compressors/log.go:57-65 | engine/compressors/tabular.go:32-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/json.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dd41d2ea23e47bcb60fc62aecbfb1bb4d6ffa7663eedb483315b54ade71012"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): browse/cmd/caveman-browse/main.go:436-444 | mem/store.go:755-765 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1535ccaeddbff3eb0b5e0db7d60353fa3bc6f78482deeeae2bd056347748e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): proxy/internal/store/middleware.go:672-680 | proxy/internal/store/middleware_postgres.go:468-476 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb79904725324d3e95acaf8aee0f5206a74e2376d748ee77641689498f959972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): proxy/internal/cloudlink/link.go:1096-1102 | proxy/providers/anthropic/splice.go:202-211 | proxy/providers/jsonsplice/jsonsplice.go:301-309 | proxy/providers/openai/content_compress.go:632-640 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdc12add05ad93886905ca167736b896e63d1910cfc22fa1c53627085b90c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): proxy/internal/store/source_codex.go:103-114 | proxy/internal/store/source_gemini.go:132-144 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_codex.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f563d446d067a5c82f44eca21ca9cfe8e989682956fa2a67bacf6307607f76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): proxy/internal/store/middleware.go:914-920 | proxy/internal/store/middleware_postgres.go:746-752 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9c037e6f2cbc32d939c09aad3ca65c1492ce9a789b8038e671e07823fab30e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): proxy/internal/translate/chat_in.go:587-596 | proxy/internal/translate/translate.go:1159-1168 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/chat_in.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12d4903dd05100874d1129a591d4708054755b2c761599a886efa99fef158b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): proxy/internal/store/middleware_originals.go:60-66 | proxy/internal/store/middleware_postgres.go:738-744 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware_originals.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b600cb03f07c961b8f17f7b9850d19101b804c65f4e637bf9f78e7746bf1e816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/ccr/store_integrity.go:184-191 | engine/ccr/store_reclaim.go:307-314 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_integrity.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0758540a7899e67083d42065c15eddb095d80156f60be7ca812366a51335f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/compressors/axtree.go:481-485 | mem/bm25.go:18-22 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e9416c41e82d48d45f517a1f458df414364a7ae2d1c1aec1df32b5114ac2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): proxy/internal/gateway/route.go:698-704 | proxy/internal/gateway/route_cache.go:114-120 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"119225b52cbed690c55c10f4835622b115ce4ec1f3f5378d03fdaaf1252a05ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/pixel/transform_anthropic.go:938-945 | proxy/internal/nativeruntime/runtime.go:456-463 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48144363aa657f8ba30d1e647edc497382cf541ad2a106dcc8dffc4d64297a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/retrieve_query.go:250-257 | proxy/providers/bedrock/routing.go:548-556 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/retrieve_query.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e23a3b6ca99a10d2bd8fac5d2440d50f215e914fd6bf2ce4d820d89fed53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/compressors/redundancy.go:90-96 | proxy/internal/gateway/prefix_monitor.go:315-321 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/redundancy.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e725676a53c9f4ec54c4692ad68551511df5e577b3abc7feea995f2d83a9016d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): packages/middleware/python/caveman_middleware/agno.py:140-140 | packages/middleware/python/caveman_middleware/crewai.py:196-196 | packages/middleware/python/caveman_middleware/google.py:482-482 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e270689883e6fb6fa6cf76576f6321412d570eea0dd44996e72cf765bbeb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): proxy/internal/gateway/pixel.go:684-686 | proxy/providers/anthropic/splice.go:198-200 | proxy/providers/openai/content_compress.go:628-630 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/pixel.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47cface5534a24d20e67113d5c91a075b9726a81f730875f30a1fded5c4a362"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): browse/session.go:347-352 | proxy/internal/gateway/raw_pin.go:263-268 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/session.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6982496b75a0dc4a31e824aeeb9d8fb4a0286de5bb4818e677de9e6e0bd6844f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): proxy/providers/anthropic/splice.go:38-77 | proxy/providers/openai/content_compress.go:480-519 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8c50600b3aaf0289f53c283ab0e0f820ea43b57f933dcfa64e38be8a666a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): proxy/internal/gateway/retrieve_tool.go:241-273 | proxy/providers/anthropic/splice.go:117-149 | proxy/providers/openai/content_compress.go:559-591 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/gateway/retrieve_tool.go:241\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"736951fef1767800877bcca3662abf5782ed18c8a42f460dc418e5de2b9001b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/compressors/toolschema_annotations.go:323-350 | proxy/providers/jsonsplice/jsonsplice.go:246-273 \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":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eee8c741f5dece88a34e9dbdec324a60114823ecd2116858a9dd386a8fbb2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): proxy/providers/adapter.go:1042-1068 | proxy/providers/bedrock/usage.go:159-182 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/adapter.go:1042\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":"proxy/providers/adapter.go"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e42e109da841bc0ea4bcd00306aa4549b58c2c9217ba736906c6e8ab102204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): proxy/providers/anthropic/splice.go:80-101 | proxy/providers/openai/content_compress.go:522-543 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"54888d1a454f1e300e9be1aaa5dc014bfab31c34d76aac6b5ff1902f7fe1f788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): proxy/providers/anthropic/splice.go:224-245 | proxy/providers/openai/content_compress.go:653-674 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/splice.go:224\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"546c085799d156a7807c549c93ebcbbfa6fe55174540f1f427280fb6c74c3825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): proxy/internal/gateway/proxy.go:864-884 | proxy/internal/gateway/proxy.go:918-933 \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 \u0060proxy/internal/gateway/proxy.go:864\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"678268847f6fc6aa3f8a8f54c7c5d5dbc02a7b86c36b96ebf1949b76f068dc6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): engine/compressors/toolschema_annotations.go:330-348 | proxy/internal/translate/jsonfast.go:71-89 | proxy/providers/jsonsplice/jsonsplice.go:253-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Check import visibility before settling on that home: \u0060proxy/internal/translate/jsonfast.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49b35d7a3f6b00a95d15bfcd92d0c3d59cb87097cba9ff7d18d6a17a2f30545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): proxy/internal/translate/chat_stream.go:316-333 | proxy/internal/translate/responses_stream.go:493-510 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/translate/chat_stream.go:316\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060proxy/internal/translate/chat_stream.go:334\u0060 calls \u0060start\u0060 and \u0060proxy/internal/translate/responses_stream.go:511\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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f403123321abc5c33c9cc9d314139010025d19d70fc9aed28fd24deb021edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): proxy/internal/translate/chat_stream.go:393-407 | proxy/internal/translate/responses_stream.go:582-598 \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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daccaec71905f4ce130d503301d18a95d9934765bd0c63c1da48aa49b7a65be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): proxy/internal/store/learn_outcomes.go:309-324 | proxy/internal/store/learn_portfolio.go:142-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/learn_outcomes.go:309\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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0afec4cbf15d282ca573e82b25095a98fde9f27e4c0938e2d81af2eb0e0f5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): proxy/internal/store/learn_retro.go:649-664 | proxy/internal/store/learn_retro.go:735-750 \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 \u0060proxy/internal/store/learn_retro.go:649\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee5422c391c288106f8e277e9d75f7ae24fc7da7511b59fea84babd04054b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): proxy/internal/store/report.go:187-202 | proxy/internal/store/report.go:238-253 \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 \u0060proxy/internal/store/report.go:187\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd68d3ec25758366266da81a3e95b65b60f8df2923cbaf21acdba811051c38f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): proxy/providers/anthropic/breakpoint_plan.go:128-141 | proxy/providers/anthropic/breakpoint_plan.go:191-206 \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 \u0060proxy/providers/anthropic/breakpoint_plan.go:128\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/breakpoint_plan.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0480075f0e365e211935fde661e8364a4749f7fb53b171e84aa9a304f84225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/compressors/searchresult.go:57-71 | engine/compressors/text.go:63-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/compressors/searchresult.go:57\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":"engine/compressors/searchresult.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90eae58fd6fd839439216b2d5064a98d68e9f8c0263ffdbb7f3c10fe1ce2719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): proxy/internal/gateway/chatgpt.go:56-66 | proxy/internal/gateway/proxy.go:143-157 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c375467e1994cc57330501aaab0890a35248a3489720a568aa5ef9cac1abab45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): proxy/internal/store/middleware.go:546-560 | proxy/internal/store/middleware_postgres.go:319-333 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/middleware.go:546\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c4f704298f2af44f9bb6d9cf485c047e564c9756c73874efca0f382d432136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): proxy/providers/bedrock/cache_points.go:175-189 | proxy/providers/bedrock/cache_points.go:192-206 \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 \u0060proxy/providers/bedrock/cache_points.go:175\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/cache_points.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d19269da832c78173c64c6e21acf9246232bb5231b2914f5139f536a1a99e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): proxy/providers/jsonsplice/jsonsplice.go:163-177 | proxy/providers/jsonsplice/jsonsplice.go:210-224 \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 \u0060proxy/providers/jsonsplice/jsonsplice.go:163\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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e112275e2afffd270b51106a5de5b36b66522a82e91af65a3d5e23ace34e1512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 2): shared/platform/ssrf/ssrf.go:214-222 | shared/platform/ssrf/ssrf.go:267-281 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81a4206f24d9aa4896f0cce52b6c9b9c186dab00847fcf5388012e23222ac87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/ccr/store_integrity.go:38-51 | proxy/internal/store/learn_experiment.go:191-204 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/ccr/store_integrity.go:38\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Check import visibility before settling on that home: \u0060proxy/internal/store/learn_experiment.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_integrity.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d8cb4c7fa1fb88d7a548666c4ee97cddf3a0df008093d6b957c7d7988f0c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proxy/internal/store/source_claude.go:25-38 | proxy/internal/store/source_pi.go:43-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_claude.go:25\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":"proxy/internal/store/source_claude.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a329c8d4316bab9744ce125e05fc06d26835e4aa9f35c2f94b317b0d24912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proxy/internal/store/source_claude.go:56-69 | proxy/internal/store/source_pi.go:79-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_claude.go:56\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"36929b5bf73b0743d6c64bf25900859c083063e947d81a3705490c9fda87a39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proxy/providers/adapter.go:1228-1241 | proxy/providers/bedrock/usage.go:593-606 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb619e4d2bc8e892858bf1085f5c2106795f52623c324fff989842137e8c2c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/compressors/toolschema_annotations.go:358-370 | proxy/internal/gateway/retrieve_tool.go:276-288 | proxy/providers/openai/content_compress.go:594-606 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87cfc19f6a7c7cdb1ed606e78c1c8fe5a466d3e4669ffcc72be68df9d39d6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): proxy/providers/anthropic/frozen.go:172-184 | proxy/providers/anthropic/splice.go:49-61 | proxy/providers/openai/content_compress.go:491-503 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060proxy/providers/anthropic/frozen.go:170\u0060 calls \u0060skipJSONSpace\u0060 and \u0060proxy/providers/anthropic/splice.go:48\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":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a64792693dc4844aa428875f662307d33f9ed928c0120315bfe0a2cca56c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/internal/store/source_claude.go:46-58 | proxy/internal/store/source_codex.go:38-50 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d0b4633493ec5f33c88f72d2c96a19781a150ab1e4ec5cb40da1e43c502e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/providers/anthropic/cache_breakpoints.go:102-114 | proxy/providers/bedrock/cache_points.go:219-231 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/cache_breakpoints.go:102\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6a14bb01a09b54150be3d530e247757403c078943c59c27992d8ba2dba83e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/providers/anthropic/frozen.go:49-61 | proxy/providers/anthropic/frozen.go:85-97 \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 \u0060proxy/providers/anthropic/frozen.go:49\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":"proxy/providers/anthropic/frozen.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ab9ebe8102545527c9ae52473854ff1f209b3a85b21d4de6f814264e461b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/providers/anthropic/splice.go:23-35 | proxy/providers/openai/content_compress.go:465-477 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/splice.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4603b4be2dace591825958e51a3f62ae5479a1df529349bc96405bb9c3d4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/ccr/store_integrity.go:37-48 | engine/ccr/store_reclaim.go:327-338 | proxy/internal/store/learn_experiment.go:190-201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Check import visibility before settling on that home: \u0060proxy/internal/store/learn_experiment.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_integrity.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"302095ba92210660bc505756658aa3d2649f8e8d8e5bbaa1bb640845d9fe6f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): proxy/internal/store/source_claude.go:59-70 | proxy/internal/store/source_codex.go:52-63 | proxy/internal/store/source_pi.go:82-93 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_claude.go:59\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb28af53ee5ebad60b65774f55c5601cb0880393a5ddf7b41adff528a79c5782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): browse/cmd/caveman-browse/main.go:108-119 | mcp/cmd/caveman-mcp/main.go:73-84 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060browse/cmd/caveman-browse/main.go:108\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mcp/cmd/caveman-mcp/main.go:85\u0060 calls \u0060MkdirAll\u0060, \u0060Errorf\u0060 and \u0060browse/cmd/caveman-browse/main.go:120\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":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6f66379f7a315ab48db71ce764b0cc59f2909e14398fee388194c9379f183f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/ccr/store_sqlite.go:571-582 | engine/ccr/store_sqlite.go:596-607 \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 \u0060engine/ccr/store_sqlite.go:571\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"957e66edac9c6eee4761fb90b04b2f5c394184c11dfce59fd7e95428b6ebfd75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/compressors/toolschema_annotations.go:147-158 | engine/compressors/toolschema_annotations.go:200-211 \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 \u0060engine/compressors/toolschema_annotations.go:147\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"96222334afbcbaa4f26b294ccfa9bf5b8b1866e36def677f7064b2fe258e65aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:708-719 | proxy/providers/openai/cache_key.go:140-151 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2932bb32c7d2b9d538c1a4eb8324cf6f0694699a9e92419c7c4ee58ce5320a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): proxy/internal/store/trial_store.go:137-148 | proxy/internal/store/trial_store.go:179-190 \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 \u0060proxy/internal/store/trial_store.go:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bbfc7b8ba18a595d2f530d63302fb1c2a1568f732f4c45f58e2da5d4a8d91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:145-156 | proxy/providers/openai/content_compress.go:58-69 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/content_compress.go:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebad5ea4ada03cc31fdf6cd7de1690b925d8d200f7dd9a551b08bc2bdfa35e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): proxy/internal/translate/chat_stream.go:394-404 | proxy/internal/translate/messages_stream.go:480-490 | proxy/internal/translate/responses_stream.go:585-595 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/translate/chat_stream.go:394\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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1e160f4e32c970bdadbff44dde84b01b5945a9cfa25a2ec246a911c468a15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/compressors/diff.go:30-40 | engine/compressors/searchresult.go:45-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/compressors/diff.go:30\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":"engine/compressors/diff.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb1829c356c7c96b26a16bdf968e3706abc3ff2f0bd098f245cdceddee64c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/compressors/toon_decode.go:101-111 | engine/compressors/toon_decode.go:113-123 \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 \u0060engine/compressors/toon_decode.go:101\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_decode.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"59687b9c34c4d5ec008a98ecf29d911d15d95e2a77a596bab56fcaee69bba1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): proxy/internal/store/report.go:81-91 | proxy/internal/store/report.go:99-109 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/report.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c55064ab9779d7dfe7150bf9906347f1cd76d2c9705d782079c534b5d787983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): proxy/internal/store/source_gemini.go:36-46 | proxy/internal/store/source_opencode.go:37-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_gemini.go:36\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_gemini.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9f2655d327c6f305e418c714718d227a68cf5535526535fdbae2b8598ba28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): proxy/internal/translate/messages_in.go:341-351 | proxy/internal/translate/messages_in.go:687-697 \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 \u0060proxy/internal/translate/messages_in.go:341\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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"392f3cc53989be029ee260f19704587647b0a6f30b9da1b82f2fe0debe6aa9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/providers/anthropic/cache_breakpoints.go:117-129 | proxy/providers/bedrock/cache_points.go:238-250 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/cache_breakpoints.go:117\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"200d9793a5922479341ae0baec3e4befa44eac562f7bbe36507041210aa840ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:272-288 | proxy/providers/openai/content_compress.go:276-292 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/content_compress.go:272\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d531c9663104713d7c1ee0485b57559166fddc5d866e3316211119d36c10bcab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): shared/platform/ssrf/ssrf.go:51-60 | shared/platform/ssrf/ssrf.go:95-104 | shared/platform/ssrf/ssrf.go:115-124 \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 \u0060shared/platform/ssrf/ssrf.go:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"818facfbc3ce219a7d6c20384cd53031985ec8e9f98c80e7e5ffeb7c0c85b927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): browse/cdp.go:165-174 | browse/cdp.go:177-186 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cdp.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af4b3d15e649682753f1b9a4bd49d0e68a41d048a279f4129420dc68f9f7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mem/store.go:312-321 | mem/store.go:330-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mem/store.go:312\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":"mem/store.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41badc925f11fc40eba56c26df1e12014745301571710d750ae3342aa2dc703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/internal/gateway/proxy.go:635-644 | proxy/internal/gateway/proxy.go:804-813 \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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64ee606871338a0cbf43c9c2d3769d2a3ec0f2e689bdc02ca6a9294070ef72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/internal/store/detect_reread.go:150-159 | proxy/internal/store/detect_subagent_spend.go:157-166 \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":"proxy/internal/store/detect_reread.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07f1441efe769606cc25e45e581b9394de76d61462a40aa7e9f0da0df6e79b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/internal/store/usage_import.go:238-247 | proxy/internal/store/usage_import.go:326-335 \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 \u0060proxy/internal/store/usage_import.go:238\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e848509fdf5cd8a2f049dbf28c3167b7e739553be22d568936788d80bc0a2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/internal/translate/messages_in.go:313-322 | proxy/internal/translate/messages_in.go:657-666 \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 \u0060proxy/internal/translate/messages_in.go:313\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1fc1ec381df3e3fd0b8816a95fc078dc22965e9d11a5ade0abd4c5a31c5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/providers/bedrock/cache_points.go:216-225 | proxy/providers/bedrock/cache_points.go:249-258 \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 \u0060proxy/providers/bedrock/cache_points.go:216\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060proxy/providers/bedrock/cache_points.go:228\u0060 calls \u0060Field\u0060 and \u0060proxy/providers/bedrock/cache_points.go:259\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":"proxy/providers/bedrock/cache_points.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13b5540312fc1f0949094fecb3238e99a32e4fdba1db3e324c2bf26f83b8f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): proxy/providers/anthropic/breakpoint_plan.go:131-139 | proxy/providers/anthropic/breakpoint_plan.go:161-169 | proxy/providers/anthropic/breakpoint_plan.go:196-204 \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":"proxy/providers/anthropic/breakpoint_plan.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b21f31e27b1c04f43cb3002d3c89665af6ec92a67c3672ecb5045e8198a4095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/compressors/json.go:84-92 | engine/compressors/toolschema.go:92-100 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/json.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e0958885f8eb33d84a885f23fc07ad99620010c271672bcff954fa9d00707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/store/source_opencode.go:155-163 | proxy/internal/store/source_opencode.go:193-201 \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 \u0060proxy/internal/store/source_opencode.go:155\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d5418f4f9bbfa0acdeb7746e992956a2fa5b11a6e2f8722d7b70590cff0578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/providers/jsonsplice/jsonsplice.go:193-201 | proxy/providers/jsonsplice/jsonsplice.go:234-242 \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 \u0060proxy/providers/jsonsplice/jsonsplice.go:193\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060proxy/providers/jsonsplice/jsonsplice.go:189\u0060 calls \u0060WriteByte\u0060, \u0060Write\u0060 and \u0060proxy/providers/jsonsplice/jsonsplice.go:231\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":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bc2cef3f5b0f085c04162544e57fba80ed824b2ab2365ff4ea13096d1347d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/compressors/log.go:119-126 | engine/compressors/searchresult.go:60-67 | engine/compressors/text.go:66-73 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/log.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a944b93e387627743eeefd4e2374e2318c26e7dec4ffbd0cdb13bfacda3b7028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/gateway/metadata_route.go:56-64 | proxy/internal/gateway/proxy.go:622-630 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/metadata_route.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"712775a1502f32d162f1f39b5dc68e1498c8bef77d9c09a18dd7adfc8a4295c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/internal/store/source_codex.go:140-147 | proxy/internal/store/source_gemini.go:123-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_codex.go:140\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_codex.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b897f437036e1fb972ef19c87d1800973d4abec51946513a4417ac5b29724a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/internal/translate/chat_in.go:255-262 | proxy/internal/translate/chat_in.go:506-513 \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 \u0060proxy/internal/translate/chat_in.go:255\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":"proxy/internal/translate/chat_in.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d5ff3d09f4fecc8dd4779c9f3ac5b63bdb7919a1057a935544524742043e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:369-376 | proxy/providers/openai/content_compress.go:429-436 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c1d09ef831b5145b32d8d1f9b19ca82389637b44c75d04b6f292b41949a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/providers/jsonsplice/jsonsplice.go:302-309 | proxy/providers/openai/content_compress.go:633-640 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/jsonsplice/jsonsplice.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eebba05cc907300a46fc6373a1328214da2d302bcd39407384ca945ce3672ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): proxy/internal/gateway/pixel.go:539-545 | proxy/internal/gateway/pixel.go:559-565 | proxy/internal/gateway/pixel.go:577-583 \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 \u0060proxy/internal/gateway/pixel.go:539\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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e432c146a1dc49bca83a08239879b4716206755dec58d10f188502ab22a4175c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/internal/gateway/metadata_route.go:94-101 | proxy/internal/gateway/oauth_token_route.go:78-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/gateway/metadata_route.go:94\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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/metadata_route.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9363d2f173e1c56a385998fd8da738d53ad4189949981614c338272afb4b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:953-959 | proxy/internal/gateway/retrieve_tool.go:1007-1013 \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 \u0060proxy/internal/gateway/retrieve_tool.go:953\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060proxy/internal/gateway/retrieve_tool.go:960\u0060 calls \u0060parseRetrieveCall\u0060 and \u0060proxy/internal/gateway/retrieve_tool.go:1014\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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"842de2fe78209b5953447a12dddbc176eeac2bcbf931b6821007b883f1bb11aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/translate/chat_in.go:143-149 | proxy/internal/translate/chat_in.go:350-356 \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 \u0060proxy/internal/translate/chat_in.go:143\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":"proxy/internal/translate/chat_in.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ea5c2ef44071e42113ca0555f74a62b650c3a9fe0263d48140e1196cf21bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/translate/chat_in.go:267-273 | proxy/internal/translate/chat_in.go:518-524 \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":"proxy/internal/translate/chat_in.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"723b030ca0ab2112d7edddb02abd8fcbf6a0fb02823e442063c4afb60fc6a399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/gateway/chatgpt.go:723-728 | proxy/internal/gateway/chatgpt.go:741-746 \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 \u0060proxy/internal/gateway/chatgpt.go:723\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060proxy/internal/gateway/chatgpt.go:747\u0060 calls \u0060appendEvent\u0060 and \u0060proxy/internal/gateway/chatgpt.go:729\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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61b7b850085a564d3215e4bb57d3abc46bddf9f09b9888b15745a87b6f6d793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:930-935 | proxy/internal/gateway/retrieve_tool.go:948-953 \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 \u0060proxy/internal/gateway/retrieve_tool.go:930\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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a002eaddeada6d39e2f8cfbfca26d122c9ba169994f81e0b4c8dece2b28d876a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/translate/messages_in.go:467-472 | proxy/internal/translate/messages_in.go:767-772 \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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db5b6749ed83b1790f8ac5b673a79e5e4c8c0013c235a2e42dd30fed1ad9583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): proxy/internal/store/learn_outcomes.go:320-324 | proxy/internal/store/learn_portfolio.go:153-157 | proxy/internal/store/session_source.go:328-332 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/learn_outcomes.go:320\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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b161dba88933c31cf79cf69e9b2ddcf49abe18b9ac7c8ad3685f5c9de840d2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): browse/cdp.go:194-199 | browse/cdp.go:212-217 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cdp.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efdb18b7661a7d6a337972cd596fc5d57d4b76b5fb154cbf0653905222cf942"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/compressors/relevance.go:36-40 | engine/contextwindow/contextwindow.go:123-127 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/compressors/relevance.go:36\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":"engine/compressors/relevance.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad958bc747dba49cdd1d8a14cd7dfed8c546737db44809b01a461690696bab98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/gateway/compression_query.go:51-56 | proxy/internal/gateway/compression_query.go:84-89 \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 \u0060proxy/internal/gateway/compression_query.go:51\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/compression_query.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fda879ea3a74a0dcdef22c5ca77539e2c0189ffa0d2981a374e4c82f5e33adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/internal/store/learn_experiment.go:132-136 | proxy/internal/store/learn_experiment.go:149-153 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5616bec90229ff54e0c51f51b4c331f9575e98a107822452976e1df5e5fb3bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/providers/anthropic/cache_breakpoints.go:27-31 | proxy/providers/openai/cache_key.go:43-47 \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":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91eec80b067d0f5ff716cdeaea8eef5392ac863b5dd91ab7604c150dbc9746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/providers/anthropic/splice.go:217-221 | proxy/providers/openai/content_compress.go:646-650 \u2014 before extracting anything, compare \u0060proxy/providers/anthropic/splice.go\u0060 and \u0060proxy/providers/openai/content_compress.go\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/splice.go:217\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":"proxy/providers/anthropic/splice.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e30f4a2079a70e84b2d8d963c5be82ef991cf14edc369ec3e5250606c73142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/ccr/store_sqlite.go:216-225 | proxy/internal/store/store.go:383-392 \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. Check import visibility before settling on that home: \u0060proxy/internal/store/store.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ccd3c9f2401cea07e07e8176c044028fb91dce6f6e432e0e2adf3bdd2febd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/cmd/caveman-engine/main.go:254-263 | shrink/cmd/caveman-shrink/main.go:86-95 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060shrink/cmd/caveman-shrink/main.go:82\u0060 calls \u0060Marshal\u0060, \u0060Fprintln\u0060 and \u0060engine/cmd/caveman-engine/main.go:251\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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d83ebee1ec954c3cb3d209760ffd6a9235f4b1177afcd7b7196e56e0e3ba804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/cmd/caveman-engine/main.go:631-637 | engine/toon.go:12-18 \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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3358ee5c4955d8455c5ce420470133307936cf94f50cb3f05d30bab5a657d65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/cmd/caveman-engine/main.go:641-651 | engine/toon.go:21-31 \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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a5a068e15a870bb5709b2c18c5c2334375163084db3c4a4a078491ecc4dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/compressors/toolschema.go:179-185 | engine/pixel/transform_anthropic.go:1452-1458 \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":"engine/compressors/toolschema.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe050c1a2e262614d86f186d09a587a3f2e9b6853bc64fac17790d83d4507c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/cloudlink/link.go:1525-1533 | proxy/internal/gateway/route.go:527-535 \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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b18b774d8ba7145e61ae3d749d18bb3e03d558d45e6795a6545709a1daa63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): proxy/internal/gateway/proxy.go:1328-1338 | proxy/internal/store/store.go:1169-1179 \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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fcbfd66d3d553f6b3deea6257673f052f3116c04aed011f9523988c7ad5c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): proxy/internal/gateway/retrieve_tool.go:290-300 | proxy/providers/anthropic/splice.go:178-188 | proxy/providers/openai/content_compress.go:608-618 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"57898897fad967f74a042e766840b2cee97b9e4e34d59d32ca3761eb82d9fd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:646-651 | proxy/providers/adapter.go:1707-1712 \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. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700466c4d337b432b4f40004a506e4fac188ed370eafb714541ba154ba9533e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): proxy/internal/gateway/retrieve_tool.go:653-664 | proxy/providers/adapter.go:1743-1754 | proxy/providers/bedrock/usage.go:630-641 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Check import visibility before settling on that home: \u0060proxy/internal/gateway/retrieve_tool.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"375382ed4a82f23f0535d8da2be0b2712df78b3ffe9acdfc6b98680949614690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/providers/adapter.go:1760-1766 | proxy/providers/bedrock/signing.go:240-246 \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":"proxy/providers/adapter.go"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ea398857fd185e3270c60156fcbdc4b7906b06d55af9c19ef89b784cc3c72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): proxy/providers/anthropic/anthropic.go:17-23 | proxy/providers/azureopenai/azureopenai.go:19-25 | proxy/providers/openai/openai.go:39-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/anthropic.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f43e4ca0535f65ab0716c243fa2c09e0641cb4c6187da1deb602f59c7b6244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:259-265 | proxy/providers/openai/content_compress.go:456-462 \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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c2b8252d8298fe2c5c164221cb4b6292c1daf43093344caef059d98c37363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:380-386 | proxy/providers/openai/content_compress.go:440-446 \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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0755a5a6c882208e46321a72e0c59da145d0fe8f6881f136f4cecb1a8f9b9107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/providers/bedrock/routing.go:529-536 | proxy/providers/vertex/routing.go:182-189 \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":"proxy/providers/bedrock/routing.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c598fb4b0853763fc56037f36c4576c7dcb6a4f63c136788c8b1596acf33b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/store/learn_attribution.go:331-337 | proxy/internal/store/learn_digest.go:107-113 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060s *Store) BuildLearnSavings(cwd\u0060 in one and \u0060s *Store) BuildLearnDigest(cwd\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_attribution.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"626edd3ba1e4609f5f5506c1d56635ad52986bb98b6b0c5201d3eea34efde642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): proxy/internal/store/trial_store.go:96-112 | proxy/internal/store/trial_store.go:152-167 \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 \u0060proxy/internal/store/trial_store.go:96\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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b358de3c3f91c6022c4d4f713473d710289595c29b6fb5faf9c1f7a8b4848e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/cmd/caveman-engine/main.go:347-359 | engine/cmd/caveman-engine/main.go:531-543 \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 \u0060engine/cmd/caveman-engine/main.go:347\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":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d63b795df8b49d42d1d91de5e6e8bd089e75e0aba1bfb99b3a5c1a15156f3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): proxy/providers/anthropic/content_compress.go:290-302 | proxy/providers/openai/content_compress.go:295-307 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/providers/anthropic/content_compress.go:290\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dc97148467f8999285c40ecc6828238c55bf4e10f933979bcdb64cfb621a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/evals/quality.go:151-161 | engine/evals/quality.go:165-175 \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 \u0060engine/evals/quality.go:151\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":"engine/evals/quality.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aae00319090d8c15200ed5b1490a16e832cbe1b1ad50078712b608dd239673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mem/cmd/cavemem/main.go:263-272 | mem/cmd/cavemem/main.go:345-354 \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 \u0060mem/cmd/cavemem/main.go:263\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":"mem/cmd/cavemem/main.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b5a6d1466c517124da8b9c7033bc64441a11836af65a3aa46da23594cc597e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/providers/adapter.go:1214-1223 | shared/platform/catalog/catalog.go:345-354 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43fea73b04becb12fac1557940fbc96d2511a5b7dc9dda49481c669034dec31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): proxy/internal/store/store.go:1196-1205 | proxy/providers/azureopenai/azure_routing.go:88-97 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/store.go:1196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Check import visibility before settling on that home: \u0060proxy/internal/store/store.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/store.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3510a4433c1f59242fa41789af25c7b96881a3cf4ad668d7840550551c7f4bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/translate/chat_in.go:53-61 | proxy/internal/translate/responses_in.go:89-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/translate/chat_in.go:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"proxy/internal/translate/chat_in.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cfa24771d73e0baa19adf2d328b0db3d7098551e16883f8afc7dce87a81777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/gateway/metadata_route.go:83-91 | proxy/internal/gateway/oauth_token_route.go:67-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/gateway/metadata_route.go:83\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":"proxy/internal/gateway/metadata_route.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"430e0721cde3afe9a102e419c0c9fd4040b252c1dfe5ce63160e9b886911c1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:755-763 | proxy/internal/gateway/retrieve_tool.go:808-816 \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 \u0060proxy/internal/gateway/retrieve_tool.go:755\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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74e069eb328e786f8f16d7184c2e8cd69eeebe9673354a984e4a667995b5f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:441-447 | proxy/internal/gateway/retrieve_tool.go:462-469 \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 \u0060proxy/internal/gateway/retrieve_tool.go:441\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3b5fa9f9f2bff5c40ae97892d9962b54222d0c9bc2ae95427f624b621aec86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:431-438 | proxy/internal/gateway/retrieve_tool.go:473-480 \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 \u0060proxy/internal/gateway/retrieve_tool.go:431\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"41862c3b1f8507d89055a89b8d07fff4771d209c0d3fff6c3c455e908729ec8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:412-418 | proxy/internal/gateway/retrieve_tool.go:437-443 \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 \u0060proxy/internal/gateway/retrieve_tool.go:412\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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb76c390ff40179bfa8d88021ffa0eee4bd40c4236051b7848657d54a84b6277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/gateway/retrieve_tool.go:736-742 | proxy/internal/gateway/retrieve_tool.go:781-787 \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 \u0060proxy/internal/gateway/retrieve_tool.go:736\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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aae4825d55bdc2d007798192457c56bc1b9a582173a5d3ce455f30e6c8391f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/translate/messages_in.go:526-532 | proxy/internal/translate/messages_in.go:810-816 \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 \u0060proxy/internal/translate/messages_in.go:526\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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b09b33a95b9ca1969668fe82f7b46f3eef8c6b94ddf5f7057bf5d881cf88f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/translate/messages_in.go:355-361 | proxy/internal/translate/messages_in.go:700-706 \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 \u0060proxy/internal/translate/messages_in.go:355\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_in.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63d1bdab2a8767963a34a389e9e4cf5d3465616e2c63ef4d3fa0bad8382b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proxy/internal/store/source_gemini.go:22-28 | proxy/internal/store/source_opencode.go:23-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/store/source_gemini.go:22\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":"proxy/internal/store/source_gemini.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"946817f07275cd1e88764d3ab75c09fbd9238c8c3f70a97ebb49026dca9a07cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/compressors/toon_encode.go:153-159 | engine/compressors/toon_encode.go:170-176 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_encode.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1773946e401e7461cb98e8c3ee8ff675c9c17f82290eb7f8c5b747faf88e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/ccr/store_sqlite.go:882-887 | engine/ccr/store_sqlite.go:905-910 \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 \u0060engine/ccr/store_sqlite.go:882\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_sqlite.go"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2b49e25bde913c2bb319b6eae40d8647c0f5ed1339e955fa876cf9f7657bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): proxy/internal/store/report.go:170-174 | proxy/internal/store/report.go:225-229 \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 \u0060proxy/internal/store/report.go:170\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":"proxy/internal/store/report.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7322be12061f76a6590c31e7ebeeea88e34cccd99d40015dd8673989ba595f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): proxy/internal/gateway/chatgpt.go:317-322 | proxy/internal/gateway/proxy.go:983-988 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060proxy/internal/gateway/chatgpt.go:317\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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ceba940fd0e49b9d4e7032dfb4b77253115390254287bf5e4583bafb9b91e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (198 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:1134-1331 | skills/caveman-compress/scripts/compress.py:1134-1331 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"91500aece7638df81f48b5e1cb9b22b2b622bde6db081c2c4185567b254b71cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:122-192 | skills/caveman-compress/scripts/validate.py:122-192 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c13f41de886845cbd3ed71a8a9dae2e06bd8932d015207ddd0fef771aa8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:945-1011 | skills/caveman-compress/scripts/compress.py:945-1011 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b0c3364c8731e2c910515cd946330542e0f9b3a93b597138a081301e393d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/detect.py:91-152 | skills/caveman-compress/scripts/detect.py:91-152 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/detect.py\u0060 and \u0060skills/caveman-compress/scripts/detect.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bc98e0517e14e290dfa3500359a4b2ab3787d8abbb9f415b45bd29f619c2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:676-733 | skills/caveman-compress/scripts/compress.py:676-733 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"546d5627424f942f0b32a1d673d0663c595496588f6b2927fd6af5793e137f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:737-793 | skills/caveman-compress/scripts/compress.py:737-793 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6f86f8d649c642741b09bcc5142782a76eb63afbe95d934015bc1a7d32965b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/cli.py:36-90 | skills/caveman-compress/scripts/cli.py:36-90 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/cli.py\u0060 and \u0060skills/caveman-compress/scripts/cli.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/cli.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"420809bc807b1c960705027b858d4d4a1512baad71f65f00509945d01a1f0eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:69-118 | skills/caveman-compress/scripts/validate.py:69-118 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"761a3f0c7a67967056e877687192f18c91b63ea63d2724e15ff7d17e41b582a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:614-658 | skills/caveman-compress/scripts/compress.py:614-658 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d26161cbab724e4938898e74f9876fcd099e9eb9931777c0900d066e83d15e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:797-841 | skills/caveman-compress/scripts/compress.py:797-841 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py:797\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b5615d0753ebcaed3e7bdf25a3b2235bb1aab595d677f411ce82464fa0aad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:209-252 | skills/caveman-compress/scripts/compress.py:209-252 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"36476e22088b2d644d6a26bf1161fedd49f4ac6759f9df9210aa3984ae708e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:243-284 | skills/caveman-compress/scripts/validate.py:243-284 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py:243\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36975960f4c4666534cf124caefe11b632f1069cb8917ed75a0522c0a09134c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:1092-1130 | skills/caveman-compress/scripts/compress.py:1092-1130 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c1149362ad37e99caf3f0b4e97c223fbb655df6f27c31e71eb636bf5447d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:275-309 | skills/caveman-compress/scripts/compress.py:275-309 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34ee6f1de2d838644b09bef9605d4bf94c466ec7dadf33bcdd9498d4d75d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/benchmark.py:46-76 | skills/caveman-compress/scripts/benchmark.py:46-76 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/benchmark.py\u0060 and \u0060skills/caveman-compress/scripts/benchmark.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/benchmark.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c27189d5b7d1a4b29e80a26eefd2264b2022e1e3c38ef48beb7a37272d4202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:358-388 | skills/caveman-compress/scripts/compress.py:358-388 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py:358\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"06982e25caf42d34884778d6effd4485886b0f581c99bd84239639c1fe46d604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:845-875 | skills/caveman-compress/scripts/compress.py:845-875 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"586b09baf1dd8a4474a7e297a32f22ad2e73a4aaf9059d832b1042ce888035dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:582-610 | skills/caveman-compress/scripts/compress.py:582-610 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7fc27bc840abd380c621e9c5dc773b7aa05de52ba6098f7e092ea31eef6a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:196-222 | skills/caveman-compress/scripts/validate.py:196-222 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"de92442351927847880647f01401947caa680ffbcb8865f968b6e1841bd1d328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:486-511 | skills/caveman-compress/scripts/compress.py:486-511 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cedef407d343f05bfe3710eb6d0c657e1609d5810e4e783cc34d4d504c66cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:291-313 | skills/caveman-compress/scripts/validate.py:291-313 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac93613358b78c076a77cc8dba174d1263b86aff52a5c439598e2bd4065d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:366-394 | skills/caveman-compress/scripts/validate.py:366-394 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af690fb8ed0531087a64b767aaa4a4568ce34179f26fc6b05c3cb3cf089030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:336-354 | skills/caveman-compress/scripts/compress.py:336-354 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"091ee280d7069c5cc8da749ac8bf198fc96e78da6f0c0bd843e933e1a6dc4347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:1015-1033 | skills/caveman-compress/scripts/compress.py:1015-1033 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"38619107c6eb8cef02d97c2aaebed18385b60be71dc845ee13be8b200626e0fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:256-271 | skills/caveman-compress/scripts/compress.py:256-271 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9964c9a4f5569b42f46b93e429bf9f5c22f99c09e35284d692d0fdb2ca1b35a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:333-349 | skills/caveman-compress/scripts/validate.py:333-349 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d0edc39b8c6290491832ac923217f987cd59fd870aeee11d835af3bacb815d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/detect.py:75-87 | skills/caveman-compress/scripts/detect.py:75-87 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/detect.py\u0060 and \u0060skills/caveman-compress/scripts/detect.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7dab526b329d7b20ed4ee4afba5c7ba5d76af838b9ff859a04790ad74ad09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:401-413 | skills/caveman-compress/scripts/validate.py:401-413 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47c23007e1dcd0a5cbb985149940d5234eade0e1c7c0b9b122ef23704085454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): evals/plot.py:90-101 | evals/plot.py:142-153 \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 \u0060evals/plot.py:90\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":"evals/plot.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"371fc7e26182b285693d2099643e941a1d87240d53fdb464fe592c0a907cc415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/middleware/python/caveman_middleware/llama_index.py:597-607 | packages/middleware/python/caveman_middleware/llama_index.py:631-641 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"991ff0434eba77f79a28977103f44cc65cb1142cbcbed4e51f58bb1d4360e7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/middleware/python/caveman_middleware/llama_index.py:496-504 | packages/middleware/python/caveman_middleware/llama_index.py:515-523 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"40899db303382e9d6243c50d400412d1ffb98cef436556554c99d5f38bd7fb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/benchmark.py:26-34 | skills/caveman-compress/scripts/benchmark.py:26-34 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/benchmark.py\u0060 and \u0060skills/caveman-compress/scripts/benchmark.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/benchmark.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"917cd7360f78579ceba4a4020f3160c65888b2c0886ed3c8beaf79b3d85747d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/middleware/python/caveman_middleware/_native.py:332-339 | packages/middleware/python/caveman_middleware/strands.py:115-122 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060packages/middleware/python/caveman_middleware/_native.py:331\u0060 calls \u0060enumerate\u0060 and \u0060packages/middleware/python/caveman_middleware/strands.py:114\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":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"589550f4bbde92ff6a5eb7e320c7408ce7c40009a108b92dbbb843370653468f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/middleware/python/caveman_middleware/agno.py:86-93 | packages/middleware/python/caveman_middleware/langchain.py:83-90 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"798f8a804d7fbf6539581bddec7f507dd10de83ef1229dace9fc0033993700b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/sdk/python/caveman_cloud/core.py:514-521 | packages/sdk/python/caveman_cloud/core.py:523-530 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"097fe0c5f4026aa62f83e91165e2e41fc2f6956092a67845f286308b76248a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:129-136 | skills/caveman-compress/scripts/compress.py:129-136 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0599df67413ba15d422a4010f597decb0fc59a07ea651549aaba341ae59cc70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:1037-1049 | skills/caveman-compress/scripts/compress.py:1037-1049 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f514fa69f5f7e42834a3bd1999de46144d69d7493db8c05801505b5363774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/middleware/python/caveman_middleware/_httpx2.py:109-114 | packages/middleware/python/caveman_middleware/_httpx2.py:145-150 \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":"packages/middleware/python/caveman_middleware/_httpx2.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953f8e01aee9499be4c25498ffa527fa148c837f1e35dc0d583caa86b41ac34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/middleware/python/caveman_middleware/agno.py:145-149 | packages/middleware/python/caveman_middleware/agno.py:157-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":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6660fe3b2202fcb432c7a8099ff86b01ee178f103d0d17f40c230e78552440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/middleware/python/caveman_middleware/google.py:507-511 | packages/middleware/python/caveman_middleware/google.py:546-550 \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":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc599adf5fafcbc31fff2e6eb36265897da5cfe50cf00ffbd2328a42bc3ede12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:54-65 | skills/caveman-compress/scripts/compress.py:54-65 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e18aa16c92e333ea2f78d66b97d123f6f82291869bdde562a6a9f8c63ae5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:117-125 | skills/caveman-compress/scripts/compress.py:117-125 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1393cec77daf74f9ea401884e6f153f9a4ca5af4905b6bc76879dc704065767a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:140-155 | skills/caveman-compress/scripts/compress.py:140-155 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py:140\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"027e899f5310a92050ded8081b58f8690030e474a47fee2aa5b5a28be37bfec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:176-180 | skills/caveman-compress/scripts/compress.py:176-180 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17f7ebf675547944be03c161a1bba994cf802e914948941066b8d110b149cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:184-193 | skills/caveman-compress/scripts/compress.py:184-193 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"203d1468046aa7f493307f538b8d6cf20c5654375c48b094b713043c6f5a4de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:197-204 | skills/caveman-compress/scripts/compress.py:197-204 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fbe58efcbc17757182530a175f3c5bf57493f3db78410bd626a3848dfa101d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:313-332 | skills/caveman-compress/scripts/compress.py:313-332 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py:313\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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"731c749add5dd4247b9be9d874945dd5781715f5251fdae252635f793cd58324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:401-415 | skills/caveman-compress/scripts/compress.py:401-415 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py:401\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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e0021999c5efdd0813d3325f358e0e7d97add197bc3341ed22ca675270dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:515-536 | skills/caveman-compress/scripts/compress.py:515-536 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9321c3d6479506aa8c58ffd4fe3f1663e86a5021a1ad17076eaab29099cff58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:553-562 | skills/caveman-compress/scripts/compress.py:553-562 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2e780afc3611a54281bce3af5ae146c16f12ddf5e20da9e200ec7c7d37a831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:566-573 | skills/caveman-compress/scripts/compress.py:566-573 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bdca02f00dabae05cb479dfee491bba57829ebd39eea10f2138a49ee71287d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:662-672 | skills/caveman-compress/scripts/compress.py:662-672 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3002e51b29c8cd3d6bdbf31513557ab8c98541f3133cbf257c501817bc85ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/compress.py:1073-1084 | skills/caveman-compress/scripts/compress.py:1073-1084 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/compress.py\u0060 and \u0060skills/caveman-compress/scripts/compress.py\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e9fa370f359a4c1867205b20d112fb0fc9518201233eb157a53459e1182959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/detect.py:156-164 | skills/caveman-compress/scripts/detect.py:156-164 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/detect.py\u0060 and \u0060skills/caveman-compress/scripts/detect.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa233fc92874adda8389846df6348e270825977fcd24a2391b52fd6f5ad88f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/detect.py:171-178 | skills/caveman-compress/scripts/detect.py:171-178 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/detect.py\u0060 and \u0060skills/caveman-compress/scripts/detect.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/caveman/skills/caveman-compress/scripts/detect.py:171\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef5cfedfc83387962aea772a582bc5c1573ae4999f7b7709173cdc6740be11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:325-329 | skills/caveman-compress/scripts/validate.py:325-329 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66a27845439e053bd758b76649cd91d75d15acf74f9a5a5657af905085b5824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/caveman/skills/caveman-compress/scripts/validate.py:353-362 | skills/caveman-compress/scripts/validate.py:353-362 \u2014 before extracting anything, compare \u0060plugins/caveman/skills/caveman-compress/scripts/validate.py\u0060 and \u0060skills/caveman-compress/scripts/validate.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 287 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50721308db2a445ef960264a4e1109ba1366f582f40e15c6e9a2fcf01629d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/middleware/python/caveman_middleware/agno.py:540-545 | packages/middleware/python/caveman_middleware/agno.py:571-576 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8aaafc6b818562fa8eebad3a4d9be0f1d56415921b394d193dc769eb949434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): packages/middleware/python/caveman_middleware/autogen.py:238-242 | packages/middleware/python/caveman_middleware/pydantic_ai.py:236-240 | packages/middleware/python/caveman_middleware/strands.py:69-73 \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, \u0060packages/middleware/python/caveman_middleware/pydantic_ai.py:235\u0060 calls \u0060_protocol\u0060 and \u0060packages/middleware/python/caveman_middleware/autogen.py:236\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":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5e096cb6d30282f3cfefca5399fa235cb6ff1606e2fe8c15fba382047a2acd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @caveman-ai/sdk: @caveman-ai/sdk: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9dbd77c19d3b30af09e275f812919777af2d0a92c13a4b06087b2119425e3a4a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MiddlewareTx (LCOM4 5): MiddlewareTx\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/middleware.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ec260d08dca63b60801210cca706c5ae54b31cf6b92a5829d54236a984a2f0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Base (LCOM4 5): Base\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e0d3e113a8beef411fd3e49fb8cd1879045e66731fcaaad925fe170468e13"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 4): Config\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/config/config.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e0b0cc033c671771348e9740ddb9d9db917a6b3355230fc01dd795ac411a3b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: langchain-model loads and runs without langchain installed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/tests/adapters.test.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33c65c4b5bcdbd7f0074fd0694d0e830eb5f90f95c64811bb2dde145592d170"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: Enter typed ahead before the first screen is shown never accepts the plan unseen: This test starts work it did not wait for (\u0060run\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 50))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/onboard-interactive.runtime.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e67ecc9cbdc008275584f12b63ae81d85bffb29933ffc03d65319b69ae1bee5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/index.ts: packages/cli/src/index.ts changed 266 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in index.spawnWrapped at line 6650. 213 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/index.ts\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":"packages/cli/src/index.ts"},"region":{"startLine":6650}}}],"partialFingerprints":{"codehealthFindingId/v1":"09312d9297fc161acc77e44edae6f1e47f67aa09fe448fee62059086e205d42f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/proxy.go: proxy/internal/gateway/proxy.go changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 268 in Server.proxy at line 131. 59 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/proxy.go\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":"proxy/internal/gateway/proxy.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedc116af873fa07618b69630b935008c2c6e1afb07d3ccd77cc30b64d5f3ed2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: installer/install.js: installer/install.js changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in install.uninstall at line 2236. 44 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- installer/install.js\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":"installer/install.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2786f5804fcbfed290fbafba06680b881bbf8fc3f26851e4d02eb67facc3290a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/route.go: proxy/internal/gateway/route.go changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Server.applyEffort at line 781. 21 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/route.go\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":"proxy/internal/gateway/route.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b62c0b49fcb9c32d33a6af8f71d4f49b064b5f2ac21f6f97c7b926ffceed4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/chatgpt.go: proxy/internal/gateway/chatgpt.go changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Server.chatgpt at line 55. 21 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/chatgpt.go\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":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95b732be5081642b95329ea7b6f7ff011bd017548d39bba748785c326325b7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/cloudlink/link.go: proxy/internal/cloudlink/link.go changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Link.ask at line 1133. 34 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/cloudlink/link.go\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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e245e7bfcb7f6aa2535b3a256db43e23fb883fcf81d787f08200b8b6b46bfe47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/cmd/caveman-proxy/main.go: proxy/cmd/caveman-proxy/main.go changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in main.runServe at line 205. 24 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/cmd/caveman-proxy/main.go\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":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b1f63cf18140c07bceed340cb463bbabb90d9a60bd174becc02346191a08a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/modules/onboard.ts: packages/cli/src/modules/onboard.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in onboard.onboard at line 123. 18 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/onboard.ts\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":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bedf48fdcefd697ddabb13d6e8336a5169de0a81748d91edcfcfac4142afac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/modules/apply.ts: packages/cli/src/modules/apply.ts changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in apply.planModules at line 366. 27 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/apply.ts\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":"packages/cli/src/modules/apply.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbeada44946d43a69fa8f73f9dceadb6d4cfe5c617857b8d49c5894a00e579c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/caveman-compress/scripts/compress.py: skills/caveman-compress/scripts/compress.py changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in compress._compress_file_locked at line 1133. 36 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- skills/caveman-compress/scripts/compress.py\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":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2079b80a32b1d9da7f1cb1f8033090ee8183b0e72549dceabfc407d3d9e089"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/caveman-activate.js: src/hooks/caveman-activate.js changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in caveman-activate.run at line 392. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/caveman-activate.js\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/hooks/caveman-activate.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"632441d6c3b9f6a56725574ee27c56cdb4be1cc9d08aae18dfc2a533e9bea6c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/translate.go: proxy/internal/translate/translate.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Reply.relay at line 558. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/translate.go\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":"proxy/internal/translate/translate.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1fed9ca953eba1c15e30560d200e67f408419da1756b665c928fa531763440"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/caveman-mode-tracker.js: src/hooks/caveman-mode-tracker.js changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in caveman-mode-tracker.handle at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/caveman-mode-tracker.js\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/hooks/caveman-mode-tracker.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f65846ab100cf726d8375a3727a8dc7376649a3b6585703d7fdeeadb89f4f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/nativeruntime/runtime.go: proxy/internal/nativeruntime/runtime.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Runtime.respond at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/nativeruntime/runtime.go\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":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5f4bbd7309c1be4efe7da4e6154e5f8cdd82126856007fbfd0684bfe6fa164"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/store.go: proxy/internal/store/store.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in store.sanitizeRequestRecord at line 575. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/store.go\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":"proxy/internal/store/store.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af55fdcd3236277baa0daa06ae6a5fa7b585518788593a0ceff162043ff5131"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/native-hook-fast.ts: packages/cli/src/native-hook-fast.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in native-hook-fast.main at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/native-hook-fast.ts\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":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"95472f61272412d014e9306c10eeed91f16d8e5d79a0a45ba56a88c6c82b1b58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/route_pool.go: proxy/internal/gateway/route_pool.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Server.serveTarget at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/route_pool.go\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":"proxy/internal/gateway/route_pool.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc22e62a70816d9a21c038d33de380e8efbedbf48261eff48085002d1a0c660d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/compile.mjs: agents/compile.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in compile.validate at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- agents/compile.mjs\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":"agents/compile.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02d77f2f7c2a24d3e979e6910400384d25c8853a674869a751e02a7d609441b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/providers/adapter.go: proxy/providers/adapter.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in providers.parseUsageBytes at line 1029. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/adapter.go\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":"proxy/providers/adapter.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfdf522ac1954b61fa9535d96f6ecbe7ae956b654506abe6fc62662252518b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/standalone/standalone.go: proxy/internal/standalone/standalone.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Creds.Resolve at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/standalone/standalone.go\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":"proxy/internal/standalone/standalone.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a92e19fce058d8ff3598537d69a80b803912da4de2a0b447f123848cfe93f30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/sdk/python/caveman_cloud/middleware/runtime.py: packages/sdk/python/caveman_cloud/middleware/runtime.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in MiddlewareRuntime.optimize at line 435. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/python/caveman_cloud/middleware/runtime.py\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":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"37892d65a4abb21f1cb9e2b44b7481b938a509440c0a492b64f897c7f4f7b7c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/chatgpt_auto.go: proxy/internal/gateway/chatgpt_auto.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in Server.chatGPTAuto at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/chatgpt_auto.go\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":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbc6b5bb7047869050cd9c42c25e6b288c7cb32b52f4e8ae564561818ab8a20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/learn.go: proxy/internal/store/learn.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Store.buildLearnPlan at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn.go\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":"proxy/internal/store/learn.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6dd2258e9c73068340cefbcc47c255d517e2cddcec4fe3b07ae4836ac3d834"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/caveman/skills/caveman-compress/scripts/compress.py: plugins/caveman/skills/caveman-compress/scripts/compress.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in compress._compress_file_locked at line 1133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- plugins/caveman/skills/caveman-compress/scripts/compress.py\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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2e53808f1549e296d2504e3ed027eba395d470751eb7106610d4776b215b31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/responses_stream.go: proxy/internal/translate/responses_stream.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in translate.streamChatToResponses at line 657. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/responses_stream.go\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":"proxy/internal/translate/responses_stream.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6793fad9ae2dbd6f7c2e68690a88bd46259bd5a69db7893f66e0d4dab8e651b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-extension/src/provider.ts: packages/pi-extension/src/provider.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ProviderRouter.apply at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/src/provider.ts\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":"packages/pi-extension/src/provider.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd7613cdd31c99bd6a46706e5613037602631f1f38f32a8f0304641416f11ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/ccr/store_sqlite.go: engine/ccr/store_sqlite.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ccr.openWithBudgetHooks at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/ccr/store_sqlite.go\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":"engine/ccr/store_sqlite.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd4277996815041bcb504ef4630d3072a890f7a86d823b6f2d4128fb00b057"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-extension/src/index.ts: packages/pi-extension/src/index.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in index.default at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/src/index.ts\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":"packages/pi-extension/src/index.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a960dd7afe0bfef7c9a74d7d7019be43647dab3ebba3b01048652b706d691f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/messages_responses.go: proxy/internal/translate/messages_responses.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in responsesToMessages.consume at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/messages_responses.go\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":"proxy/internal/translate/messages_responses.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"50108b0c16781f4a00f88716f7f44b3f7649d7f142972e84a0ddd9a73c2adf7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/caveman-config.js: src/hooks/caveman-config.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in caveman-config.safeWriteFlag at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/caveman-config.js\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/hooks/caveman-config.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd529fda6fe39936a0cc0343ffb22fbab71284053282a27f265d41311f8a84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/modules/doctor.ts: packages/cli/src/modules/doctor.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in doctor.modulesDoctor at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/doctor.ts\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":"packages/cli/src/modules/doctor.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9565ffa0f4b982c133e6753db0b1c764dbd4537833b2119e55b207b1f6bf12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/prefix_monitor.go: proxy/internal/gateway/prefix_monitor.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in prefixMonitor.observe at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/prefix_monitor.go\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":"proxy/internal/gateway/prefix_monitor.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"191036ea0337776b8c846507cfa0083478b3ef3b5f1ab39f94586900d07c9a37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/learn-autopilot.ts: packages/cli/src/learn-autopilot.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in learn-autopilot.runAutopilot at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/learn-autopilot.ts\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":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce89102a6eca0f471993a9776ffa43f19d7e1b68c5fa1ff5eacc6e0cce4b81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/compressors/invariants.go: engine/compressors/invariants.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in compressors.summarizeElided at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/compressors/invariants.go\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":"engine/compressors/invariants.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7eaf32a7e086040027bffc7f4328b3aa86f7a830add92770539728f577497"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/middleware/runtime.go: proxy/internal/middleware/runtime.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Runtime.publish at line 417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/middleware/runtime.go\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":"proxy/internal/middleware/runtime.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed79a190b456ee098df87875ce8cf208c86f334e93fb4de676d844ac92aab3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/messages_stream.go: proxy/internal/translate/messages_stream.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in translate.sseLines at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/messages_stream.go\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":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a083ad813b7d637e13fd8305c8acd5844356212b9653f5bf1ef39e1d421b366"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/caveman-stats.js: src/hooks/caveman-stats.js changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in caveman-stats.parseSession at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/caveman-stats.js\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/hooks/caveman-stats.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2582cfca6391f1798fbbd0acff0dea9f013b73c95bb7ecf6d6127070c4b599c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/session_source.go: proxy/internal/store/session_source.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in sessionEventConsumer.consume at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/session_source.go\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":"proxy/internal/store/session_source.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387c3ad134647fcc4ae45c88892480ffe1ae2ced689971ef012a89504dd7b07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/sdk/typescript/src/middleware/runtime.ts: packages/sdk/typescript/src/middleware/runtime.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in MiddlewareRuntime.#optimize at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/typescript/src/middleware/runtime.ts\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":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37990d8456a0ac730f87b9092a60a2eae12b7fd569d6ae2da92c9a290bff319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/config/config.go: proxy/internal/config/config.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Config.withDefaults at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/config/config.go\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":"proxy/internal/config/config.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"af69b295111bcc32d7933b6341155abe5a204a06866a278a77bcc290b5f80547"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/mastra.ts: packages/middleware/typescript/src/mastra.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in mastra.createProcessor.prepare at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/mastra.ts\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":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"661ff9f222e1abcfa325992a513f2b6653f9cd4db82dcbae1b0b2342f85c99e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/ai-sdk.ts: packages/middleware/typescript/src/ai-sdk.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ai-sdk.project at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/ai-sdk.ts\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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28316d1051290b8a9f534c6eca9a811a7669a96f9e33d838b38a16e649f175"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/report.go: proxy/internal/store/report.go changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in store.learnTLDR at line 612. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/report.go\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":"proxy/internal/store/report.go"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7434f7673f184b366a415b56e93a1ded0023abadba84efdf255af59f26a2293e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/middleware/http.go: proxy/internal/middleware/http.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Runtime.ServeHTTP at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/middleware/http.go\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":"proxy/internal/middleware/http.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc50aaa8c0a845e04d78b21b1be54c954762fff643c5cf0843ee4730ead21f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/middleware/recovery.go: proxy/internal/middleware/recovery.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Runtime.retrieve at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/middleware/recovery.go\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":"proxy/internal/middleware/recovery.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38438b155a2b7ed374f582b628f612983690f823c9e9ece1b164501cf4f8fb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/sdk/typescript/src/middleware/validate.ts: packages/sdk/typescript/src/middleware/validate.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in validate.checkPlan at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/typescript/src/middleware/validate.ts\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":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf63e32ad41ba544ce4bf32896c0e7128a0439e90c8c023d379cc0516cee942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/caveman-parse.js: src/hooks/caveman-parse.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in caveman-parse.parseModeChange at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/caveman-parse.js\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/hooks/caveman-parse.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafcb35ea2dc852145ba042e14bc7ed0c82d1d898a566db19245cf37371a7ce7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/messages_in.go: proxy/internal/translate/messages_in.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in translate.appendChatMessage at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/messages_in.go\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":"proxy/internal/translate/messages_in.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"741856a75c4b6ab6f62024e5a56dfe1bf33a6bcdb716b65ab456871b7afefbf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/chat_in.go: proxy/internal/translate/chat_in.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in translate.chatResponsesBody at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/chat_in.go\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":"proxy/internal/translate/chat_in.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c071df6b2fb7d0bdb8c53a1d1eee21f45d88893753abdc9d816e9e91fb0b4366"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: evals/llm_run.py: evals/llm_run.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in llm_run.main at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- evals/llm_run.py\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":"evals/llm_run.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bff44574390d8edcb488a77c99fcd19a04318b0eb68483952afc29f1a7ac574"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/chat_stream.go: proxy/internal/translate/chat_stream.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in translate.streamResponsesToChat at line 432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/chat_stream.go\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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecca59e218fcffe4da883a2ad089d69589d25ba71edce5910be382a3b12de38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: installer/lib/openclaw.js: installer/lib/openclaw.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in openclaw.installOpenclaw at line 353. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- installer/lib/openclaw.js\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":"installer/lib/openclaw.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c0975c85a755bc5f97d111377c699ccf5b2207bbb9846479f12bc786805c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/messages.go: proxy/internal/translate/messages.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in translate.stripForeignThinking at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/messages.go\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":"proxy/internal/translate/messages.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"03595657d01cdae365a3a6b6ca5a5e6c210ad5456c1ec41ee1c3ae83379834ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: installer/lib/portable-process.js: installer/lib/portable-process.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in portable-process.resolveWindowsNodeShim at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- installer/lib/portable-process.js\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":"installer/lib/portable-process.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a6dcb7cc4199a16210863c45ae04fe791edeb0d29727cd3a335b987376595e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/pixel.go: proxy/internal/gateway/pixel.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gateway.collectOpenAIChatPixelLiveZone at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/pixel.go\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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea46f7bcd9d7ded756607a70c574cc62fe61cdb9e5d76005374cd1907478aaa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/detect.go: engine/detect.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Engine.Detect at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/detect.go\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":"engine/detect.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a928001a40dc7bfde20fdf623dda1bf3872cf2e1631c63da39005ae521fe46d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/google.ts: packages/middleware/typescript/src/google.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in google.project at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/google.ts\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":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1384a35b146d925be202d281a443fc6d772e1f610f12707c4697f5b13201c45f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/strands.py: packages/middleware/python/caveman_middleware/strands.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in CavemanModel._project at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/strands.py\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":"packages/middleware/python/caveman_middleware/strands.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc764d3db643ead181f10c9eb767d95a45aa240f28d141eedbadb7eecdcea8c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp-servers/caveman-shrink/index.js: src/mcp-servers/caveman-shrink/index.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in index.transformResponse at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/mcp-servers/caveman-shrink/index.js\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/mcp-servers/caveman-shrink/index.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a402939846f21b7296e31f6fbfff6b7fc522d14597a4856cc04369bbd46f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/stats.go: proxy/internal/store/stats.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in Store.BuildStatsReport at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/stats.go\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":"proxy/internal/store/stats.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4b2a90d4dee2d0dae4628c28b2f9329110fc42649f5283a68ada8606ecc431"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/msgbuild.go: proxy/internal/translate/msgbuild.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in translate.messagesFinish at line 307. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/msgbuild.go\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":"proxy/internal/translate/msgbuild.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8be642e7e9c9a3d71638286aede322d8ecfd3164abb0be205f7ccbc8d02b2d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/learn_portfolio.go: proxy/internal/store/learn_portfolio.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in store.scanLearnSessionMetricsUntil at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn_portfolio.go\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":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c6a1dfd66ff03cae0b0f0efd0d696e2a47f0bc171bb3731bc887b773c3d1dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/mcp.ts: packages/middleware/typescript/src/mcp.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CavemanMCPHost.project at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/mcp.ts\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":"packages/middleware/typescript/src/mcp.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ace1606d069678b62efe204071a1d07ee4883c355904c8121616622a2982144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/pool/pool.go: proxy/internal/pool/pool.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Store.saveIf at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/pool/pool.go\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":"proxy/internal/pool/pool.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"06614d7443b7faa858f6a8f0d5042371449241a5f3107aa46d1ff782a3e2c16a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/langchain-model.ts: packages/middleware/typescript/src/langchain-model.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in langchain-model.prepareLangChain at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/langchain-model.ts\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":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb525921d332a9a015fe03b1d3444fd97d3cc556fcbb2dddcd29415aed92408"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/langchain.ts: packages/middleware/typescript/src/langchain.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in langchain.createCavemanLangChain at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/langchain.ts\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":"packages/middleware/typescript/src/langchain.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47f10944bbbb48bc78f39f63322f32acfd44ed5d03427c013f0fc810fb2fbbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/middleware.go: proxy/internal/store/middleware.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Store.InitMiddleware at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/middleware.go\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":"proxy/internal/store/middleware.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f18ebd7410bdf98efd5b8b3221e7a586b0fb4244b9f448e335f7794a87caf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/crewai.py: packages/middleware/python/caveman_middleware/crewai.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CavemanLLM._options at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/crewai.py\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":"packages/middleware/python/caveman_middleware/crewai.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef14fca9ef587cf5e3e98cfd01790f7a7151cecc0f8a629c67c74d00a87d7f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/openai.ts: packages/middleware/typescript/src/openai.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in openai.wrapOpenAI at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/openai.ts\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":"packages/middleware/typescript/src/openai.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5392fd96f23ebd3a5a6a3846c430f1f73fbf278329a0d53396e12703cce542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/translate/responses_in.go: proxy/internal/translate/responses_in.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in translate.responsesChatBody at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/responses_in.go\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":"proxy/internal/translate/responses_in.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e35d253e06d2a6bebf6e444d5827d1beba49fa07cfb9702d76cb63cf970665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/google.py: packages/middleware/python/caveman_middleware/google.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in google._prepare at line 303. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/google.py\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":"packages/middleware/python/caveman_middleware/google.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba2be5feed6ace3ce08b6ecea5ddad248cfd441a28bf59e17965b4d1ffed19a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/caveman/skills/caveman-compress/scripts/validate.py: plugins/caveman/skills/caveman-compress/scripts/validate.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in validate.extract_indented_code_blocks at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- plugins/caveman/skills/caveman-compress/scripts/validate.py\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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11da929fc60b984b40182b332c1a09fda15f285bb4b062c896f8ce8ef72b8355"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/caveman-compress/scripts/validate.py: skills/caveman-compress/scripts/validate.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in validate.extract_indented_code_blocks at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- skills/caveman-compress/scripts/validate.py\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":"skills/caveman-compress/scripts/validate.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1f9b65759897762ceb4a78708807b5cfee645eac058643eeebcc98c5ed6ae7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/transport.ts: packages/middleware/typescript/src/transport.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in transport.createCavemanFetch.cavemanFetch at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/transport.ts\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":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5c6b4d011f29761765cc6bfd9308b4f1acf199fd31f7bc056f1af55fb76d3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/typescript/src/anthropic.ts: packages/middleware/typescript/src/anthropic.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in anthropic.wrapAnthropic at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/anthropic.ts\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":"packages/middleware/typescript/src/anthropic.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa84a299b54018129be4e4aa5c3a79c1136581b9c0a574935c604ef2ba1fddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/llama_index.py: packages/middleware/python/caveman_middleware/llama_index.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CavemanLLM._options at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/llama_index.py\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":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde1d3c7ba2e9ae8ee56c689b40a4006bc254fc1aa0ced6919fae9d39b9ac52c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/asgi.py: packages/middleware/python/caveman_middleware/asgi.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in CavemanASGIMiddleware.__call__ at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/asgi.py\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":"packages/middleware/python/caveman_middleware/asgi.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8e6a66dc5c87c210847145314eef5b42b0c05f1bae97d7a5ed25c30a91e8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: installer/lib/owned-install.js: installer/lib/owned-install.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in owned-install.installOwned at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- installer/lib/owned-install.js\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":"installer/lib/owned-install.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e506a65e99c11b6cba91879cba8fb145a9a793c9ecdd3d261b3f1f8b440f319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/pydantic_ai.py: packages/middleware/python/caveman_middleware/pydantic_ai.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CavemanModel._project at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/pydantic_ai.py\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":"packages/middleware/python/caveman_middleware/pydantic_ai.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efdb7f6113f21477b24d74ea51ffd40acdcda23da162466a632028f7d3f8a7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extension/scripts/firefox-e2e.mjs: extension/scripts/firefox-e2e.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in firefox-e2e.main at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- extension/scripts/firefox-e2e.mjs\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":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"024d3c51b0cf76c435991f2fa26796e26e4f965536e80c9f6ce3e25b18a7937d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/toolschema_strip.go: proxy/internal/gateway/toolschema_strip.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Server.stripToolSchema at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/toolschema_strip.go\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":"proxy/internal/gateway/toolschema_strip.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5794c47d17e3fc3eab1d7e721e36d2c760b556cf82697aa37f0232cb9cd4cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/detect_memory_health.go: proxy/internal/store/detect_memory_health.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in store.memoryOrphansSink at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/detect_memory_health.go\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":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ef7ec82b2f1f051313e810186401c1861e7ce386f531232ef8188637ff64ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/providers/bedrock/routing.go: proxy/providers/bedrock/routing.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Adapter.ResolveUpstreamURL at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/bedrock/routing.go\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":"proxy/providers/bedrock/routing.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"41328adf44d431381e41671b64730d09510e9d1805bc03d19f605cc5fb063e97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/learn_outcomes.go: proxy/internal/store/learn_outcomes.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in store.scanConfirmedFixMetrics at line 288. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn_outcomes.go\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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"993a1b85de03d9e409dd3b5f5f3b20cb758d5c343760168381b1656924823d64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/openai.py: packages/middleware/python/caveman_middleware/openai.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in openai.with_caveman_openai_tools at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/openai.py\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":"packages/middleware/python/caveman_middleware/openai.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f54529dc323a4f62cf53ac2cb7e427543845a52addd6b01c0e22fa72711261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/providers/openai/content_compress.go: proxy/providers/openai/content_compress.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in openai.responsesZones at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/openai/content_compress.go\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":"proxy/providers/openai/content_compress.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1895de34fbf85b8c1fb2e0e4265d2a0364e32bcf74e760c2f8aaff1e2b0c53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/middleware/python/caveman_middleware/mcp.py: packages/middleware/python/caveman_middleware/mcp.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CavemanMCPHost._project at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/mcp.py\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":"packages/middleware/python/caveman_middleware/mcp.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7387f80aaf42ca6dbdfe2ae9dfd5dca59c338fb74480a287cd079fc254ac0c67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/sdk/typescript/src/index.ts: packages/sdk/typescript/src/index.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in OTelExporter.recordSpan at line 2225. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/typescript/src/index.ts\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":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1f9f244d7412525ce574bbec58004bf78f46d805d451325ed0362f9a797ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/nativehook/hook.go: proxy/internal/nativehook/hook.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in nativehook.currentRepositoryState at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/nativehook/hook.go\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":"proxy/internal/nativehook/hook.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e29d98a2e2871b9dfb944b9ab1a7d18da4fb7298b1ffa3d81d2d500d88a501"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/cache_warm.go: proxy/internal/gateway/cache_warm.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Server.armCacheWarm at line 614. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/cache_warm.go\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":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca51398c625e3f6109e8400fea49ee9ec13c6e7ebd882abf8cab2e2a8e769acc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: supabase/functions/blocks-telemetry/ingest.ts: supabase/functions/blocks-telemetry/ingest.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ingest.toRow at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- supabase/functions/blocks-telemetry/ingest.ts\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":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"03854718f386d1af7f066c7adced538e653e5f121b8dbd9f975c429256b1376e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/sdk/python/caveman_cloud/core.py: packages/sdk/python/caveman_cloud/core.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OTelExporter.record_span at line 1661. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/python/caveman_cloud/core.py\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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf99ef3ec3f0355e099a58dded5af50cbb517dba52a00f73c855116dd059500"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/compressors/json.go: engine/compressors/json.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in compressors.anomalyIndices at line 341. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/compressors/json.go\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":"engine/compressors/json.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e16201215e2d71f0663e83a8909898837db49024159e45e6582e2421b2a9a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/providers/openai/cache_key.go: proxy/providers/openai/cache_key.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Adapter.ApplyProviderNativeTransforms at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/openai/cache_key.go\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":"proxy/providers/openai/cache_key.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e21fdb1d41c5f53195a21c4d980bd17d80927d10a6dd9a7694e810a50c78192"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/provider-routing.ts: packages/cli/src/provider-routing.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in provider-routing.verifiedProviderRoute at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/provider-routing.ts\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":"packages/cli/src/provider-routing.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b974632608bc4f665a603f4ca4d7b8983f4ba3e19334eed5cff420fafc4067"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/learn_trends.go: proxy/internal/store/learn_trends.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in store.buildLearnTrends at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn_trends.go\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":"proxy/internal/store/learn_trends.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fa340b339700bffeace8c8486cfa8d385d779621e7ca1e60604ad8f534875d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/learn-trends.ts: packages/cli/src/learn-trends.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in learn-trends.learnTrendTable at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/learn-trends.ts\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":"packages/cli/src/learn-trends.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170323be6d9995f30711897b9a0d8fc32679de678836ba0e6e94f5fb4b0ed32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/middleware/choices.go: proxy/internal/middleware/choices.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Runtime.prepareChoice at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/middleware/choices.go\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":"proxy/internal/middleware/choices.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bb2c197ed2a0e63d554fd6fea9e1b42276ef34e53fee3aed92c7cd9977e0a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/gateway/stats_accounting.go: proxy/internal/gateway/stats_accounting.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in gateway.requestAccounting at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/stats_accounting.go\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":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43b47fb182b129d5c1a4596ce80ab99d4b598e2518c2ccc2e9ad2ecbac77c73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/middleware_postgres.go: proxy/internal/store/middleware_postgres.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in postgresMiddlewareTx.ExpireBatch at line 542. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/middleware_postgres.go\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":"proxy/internal/store/middleware_postgres.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba47acd908dbf14e4ae88dc7c95ecd25f5b409325f75276c308e467bc9a27df9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/providers/bedrock/signing.go: proxy/providers/bedrock/signing.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Adapter.SanitizeAndMapHeaders at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/bedrock/signing.go\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":"proxy/providers/bedrock/signing.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5634b81c591c1f0def3585e6bd522fdba5616712dcb21f7efd3ca671a24cff65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-extension/src/tool-output.ts: packages/pi-extension/src/tool-output.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in tool-output.shrinkToolResult at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/src/tool-output.ts\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":"packages/pi-extension/src/tool-output.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ec853fc81a1773f028785306a2053c4150486d4d15b30beffeae28b34ad15b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proxy/internal/store/learn_experiment.go: proxy/internal/store/learn_experiment.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in store.buildExperimentReport at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn_experiment.go\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":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"762b5523cd789d92cfdbe0a007b088096de76ad3669c4489ea3324a0aa1ac27f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: shared/platform/awscreds/awscreds.go: shared/platform/awscreds/awscreds.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Provider.Credentials at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- shared/platform/awscreds/awscreds.go\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":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aef672809b67fb1154edd821b8e681be368428569086d5a101d6e80914e688"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/check-profile-scope.mjs: agents/check-profile-scope.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in check-profile-scope.checkProfileScope at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- agents/check-profile-scope.mjs\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":"agents/check-profile-scope.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7332d3dd39c02203f1a2057fd0b8ac2d20437bf126f49e606c4c33a4e6e63089"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/native-enable.runtime.mjs: packages/cli/tests/native-enable.runtime.mjs changed 89 times in last 90 days and 72 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is (anonymous) at line 1163), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): pin Gemini API-key auth when routed\u201D; \u201Cfix(opencode): carry the host project directory into generated native calls\u201D; \u201Cfix(opencode): act on an owner-routed locationless session.deleted\u201D; \u201Cfix(cli): ignore managed hook object key order\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/native-enable.runtime.mjs\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":"packages/cli/tests/native-enable.runtime.mjs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c877a0fa9a2ecf9eb17b32fd388689143263da170ab414e3a7784d6d276dfd3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/onboard-setup.runtime.mjs: packages/cli/tests/onboard-setup.runtime.mjs changed 22 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is (anonymous) at line 267), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): a port is ours only when its listener vouches for the run state\u201D; \u201Cfix(cli): an agent left on its own endpoint is said once and never offered\u201D; \u201Cfix(cli): report Codex hooks untrusted, and say once how to trust them\u201D; \u201Cfix(cli): a runtime still starting or slow to answer is not foreign\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/onboard-setup.runtime.mjs\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":"packages/cli/tests/onboard-setup.runtime.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb638e8bf13c4ad850d521e95627f95ffde73f9be7710822c71c1aefe5d8e6b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/gateway/server.go: proxy/internal/gateway/server.go changed 29 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is gateway.New at line 593), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): thinking fitted without an effort; no estimate left over cached input\u201D; \u201Cfix(proxy): pool attempts are logged and kept on the row; fallback effort capped with thinking off\u201D; \u201Cfix(proxy): stop the tripwire calling designed or racing changes caveman\u0027s (#1105)\u201D; \u201Cfix(proxy): scope the raw pin to the lineage the provider re-cached (#1105)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/server.go\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":"proxy/internal/gateway/server.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"427fc8d2fd9e0a7875fd35f20fe8e41a5086b5dc7dddffa355eee1819f0db45c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/onboard-interactive.runtime.mjs: packages/cli/tests/onboard-interactive.runtime.mjs changed 21 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 196), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): name the undo for Auto keys setup stores\u201D; \u201Cfix(setup): never suggest caveman claude when no agent is set up\u201D; \u201Cfix(cli): review fixes for the npx handoff, the first screen and the shims\u201D; \u201Cfix(cli): respect explicit choices and clear stale Auto choices\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/onboard-interactive.runtime.mjs\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":"packages/cli/tests/onboard-interactive.runtime.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e87ca2505ad28e24748b0abd112359b15cc0659a1b81a905875977556d46844"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/qwen-wrap.runtime.mjs: packages/cli/tests/qwen-wrap.runtime.mjs changed 20 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is withEnv at line 34), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(test): move the qwen version literals with the 0.24.4 pin\u201D; \u201Cfix(cli): fail closed on unverifiable proxy owners, strip attributed routes on direct launch\u201D; \u201Cfix(cli): name per-session recovery and lock Qwen/Kilo control surfaces\u201D; \u201Cfix(cli): guard Qwen route overrides\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/qwen-wrap.runtime.mjs\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":"packages/cli/tests/qwen-wrap.runtime.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aad49423f60339362e4e22d2af353ee4c84a16ae27df3858e1060c8bf49e779"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/modules-apply.runtime.mjs: packages/cli/tests/modules-apply.runtime.mjs changed 17 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 489), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): check cloud.json before unwiring, and name only modules that were on\u201D; \u201Cfix(cli): an agent left on its own endpoint is said once and never offered\u201D; \u201Cfix(cli): keep agent-wired modules on while an agent stays wired\u201D; \u201Cfix(cli): never re-point an agent that uses its own endpoint\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/modules-apply.runtime.mjs\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":"packages/cli/tests/modules-apply.runtime.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd2c6d06d94a30d847074379d7fd3c29147cf5b46976c5ca36fce7a854fdb50"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/modules-status.runtime.mjs: packages/cli/tests/modules-status.runtime.mjs changed 13 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is (anonymous) at line 182), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): say when the recovery store stops compression, and why\u201D; \u201Cfix(cli): status and doctor poll a foreign port once per command\u201D; \u201Cfix(cli): Windows stop drops the run state of a runtime it ended the hard way\u201D; \u201Cfix(cli): a port is ours only when its listener vouches for the run state\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/modules-status.runtime.mjs\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":"packages/cli/tests/modules-status.runtime.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bace2b03885ef939df4e87c49e6dab16373fd3a49f4739e31061c6719f07ef21"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/tests/integration.runtime.mjs: packages/pi-extension/tests/integration.runtime.mjs changed 14 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): send per-prompt context as a message, keep the system prompt stable\u201D; \u201Cfix(pi): follow cloud.json localPort to the moved local runtime\u201D; \u201Cfix(pi): shrink tool output only when the session can call caveman_retrieve\u201D; \u201Cfix(cli): the prompt hook and pi follow the explicit gateway choice too\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/tests/integration.runtime.mjs\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":"packages/pi-extension/tests/integration.runtime.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d6ca6a8ebe237c698531cc369575086ce152b558d1893284b70edb9a3395bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/kilo-wrap.runtime.mjs: packages/cli/tests/kilo-wrap.runtime.mjs changed 14 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is withEnv at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): wait for a freshly started proxy\u0027s run state before judging its owner\u201D; \u201Cfix(cli): name per-session recovery and lock Qwen/Kilo control surfaces\u201D; \u201Cfix(cli): guard Kilo managed routing\u201D; \u201Cfix(cli): parse Kilo boolean arity\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/kilo-wrap.runtime.mjs\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":"packages/cli/tests/kilo-wrap.runtime.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d4b70b52c231765c2901a0070df29cf080cec268cedcf3b30aa55480c79f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/windows-platform.runtime.mjs: packages/cli/tests/windows-platform.runtime.mjs changed 11 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is (anonymous) at line 137), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shrink-hook): emit a rewrite the host\u0027s own shell can parse\u201D; \u201Cfix(windows): the home allowlist accepts Caveman\u0027s own multi-part temps and lock graves\u201D; \u201Cfix(windows): a home is Caveman\u0027s only with its own files, and says why not\u201D; \u201Cfix(windows): rewrite only a home caveman owns, and only when anyone else may read it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/windows-platform.runtime.mjs\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":"packages/cli/tests/windows-platform.runtime.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a8736d6c0bce21d17c5675a357bcd2e87a9b77e31fc27e95281a1e905641a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/plugins/opencode/plugin.js: src/plugins/opencode/plugin.js changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is plugin.CavemanPlugin.experimental.chat.system.transform at line 369), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): honor OPENCODE_CONFIG_DIR in the CLI, installer and plugin\u201D; \u201Cfix(opencode): strip trailing newlines without a quadratic regex\u201D; \u201Cfix(opencode): honor a repo defaultMode=off from the plugin\u0027s own context\u201D; \u201Cfix(opencode): a subagent session no longer resets or switches the user\u0027s mode\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/plugins/opencode/plugin.js\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/plugins/opencode/plugin.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"92208b551d6cc67cfdc35becc941b9d54530a06e927db07008c306309c69c1fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/login.runtime.mjs: packages/cli/tests/login.runtime.mjs changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is (anonymous) at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): login and logout drop the old account\u0027s refresh outcome, so status stops saying refresh offline\u201D; \u201Cfix(cli): routing disclosure names agent headers, OpenCode ids and the previous request\u0027s age\u201D; \u201Cfix(cli): routing copy says it picks the model and effort and sends request facts\u201D; \u201Cfix(cli): setup says what routing sends, before and after it turns on\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/login.runtime.mjs\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":"packages/cli/tests/login.runtime.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddca44614119857ca459f68b2ce23f8abfeb1b154f472024ebb24aff4fc19e19"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/wrap.runtime.mjs: packages/cli/tests/wrap.runtime.mjs changed 12 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is runWithProxyCapture at line 290), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): pin Gemini API-key auth when routed\u201D; \u201Cfix(cli): one own-endpoint check per agent for enable, wrap and doctor\u201D; \u201Cfix(wrap): count the bare remote-control word only as the first argument\u201D; \u201Cfix(wrap): detect Remote Control by its flag, not only the legacy subcommand\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/wrap.runtime.mjs\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":"packages/cli/tests/wrap.runtime.mjs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a54e0ebd90fdb23b5e06c1f05a61593818c37639bb242c7c25e19152a1d6f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/middleware/typescript/src/compatibility.ts: packages/middleware/typescript/src/compatibility.ts changed 11 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is compatibility.frameworkGate at line 96), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(middleware): tell users below a framework floor to upgrade\u201D; \u201Cfix(middleware): require patched MCP SDK\u201D; \u201Cfix(middleware): admit the Anthropic SDK major in both hosts\u201D; \u201Cfix(middleware): extend the Anthropic SDK range over 0.136 and 0.137\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/typescript/src/compatibility.ts\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":"packages/middleware/typescript/src/compatibility.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"180574909ec535cda7b216f54c9df9eaa0668898a0a083e4da2fb9f0c08e1f7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/hooks.runtime.mjs: packages/cli/tests/hooks.runtime.mjs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is (anonymous) at line 1642), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): honor OPENCODE_CONFIG_DIR in the CLI, installer and plugin\u201D; \u201Cfix(opencode): generate a shrink plugin the installed major can load\u201D; \u201Cfix(hermes): write config YAML that still parses\u201D; \u201Cfix(hosts): hide the console window every host child opens on Windows\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/hooks.runtime.mjs\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":"packages/cli/tests/hooks.runtime.mjs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9d1706f4765e2cab91634efe4b0749b11f3f406e1061c08f4a6390977e24d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/routing.runtime.mjs: packages/cli/tests/routing.runtime.mjs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is (anonymous) at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): status stops saying routing skips subscription turns\u201D; \u201Cfix(cli): routing disclosure names agent headers, OpenCode ids and the previous request\u0027s age\u201D; \u201Cfix(cli): routing copy says it picks the model and effort and sends request facts\u201D; \u201Cfix(cli): setup says what routing sends, before and after it turns on\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/routing.runtime.mjs\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":"packages/cli/tests/routing.runtime.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbce2f01f488084c2b99522c0ad0495d0d367f16150b139fe44f4400bb53c5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/portable-command.runtime.mjs: packages/cli/tests/portable-command.runtime.mjs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 321), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): launch an npm cmd shim that forwards to a native .exe\u201D; \u201Cfix(cli): hooks, MCP servers and plugins name the node that outlives an upgrade\u201D; \u201Cfix(cli): write node and npx\u0027s script into MCP configs on Windows\u201D; \u201Cfix(delegate): launch every Windows shim the CLI can, and test parity\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/portable-command.runtime.mjs\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":"packages/cli/tests/portable-command.runtime.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"050fff2af43cccded329ed0b426a1cd6cca916f5462df09380c5228967e5ac50"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/learn-autopilot.runtime.mjs: packages/cli/tests/learn-autopilot.runtime.mjs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 393), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): say \u0027per message on average\u0027 for recurring pasted blocks in nudge\u201D; \u201Cfix(learn): plain words in terminal, TUI, trends and nudge output\u201D; \u201Cfix(learn): make nudge claims token-owned and write in-flight first\u201D; \u201Cfix(learn): gate autopilot on proxy learn capabilities\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/learn-autopilot.runtime.mjs\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":"packages/cli/tests/learn-autopilot.runtime.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c88d03b55e3d8f65a78eaaf8f532ad36fcfbf66ff2f82dc65a89dafed28483"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/modules-index.runtime.mjs: packages/cli/tests/modules-index.runtime.mjs changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 296), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): onboarding shows the install\u0027s warnings as steps, not under its progress line\u201D; \u201Cfix(cli): an empty install lock no longer holds launches for ten minutes\u201D; \u201Cfix(cli): one runtime install at a time; restart only an idle runtime\u201D; \u201Cfix(cli): keep the runtime restart quiet under onboarding\u0027s progress line\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/modules-index.runtime.mjs\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":"packages/cli/tests/modules-index.runtime.mjs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e52ad6c822c9521850f4b601a15fb7b2d14558ac830b075ff26d1d3e3b385d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/portable-command.ts: packages/cli/src/portable-command.ts changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is portable-command.resolveWindowsNodeShim at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): launch an npm cmd shim that forwards to a native .exe\u201D; \u201Cfix(pi): run stock npx.cmd and .exe-forwarding shims on Windows\u201D; \u201Cfix(windows): launch Node\u0027s own npm.cmd/npx.cmd and pnpm .exe shims\u201D; \u201Cfix(cli): launch an agent whose Windows shim forwards to a native .exe\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/portable-command.ts\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":"packages/cli/src/portable-command.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff573c0acd632978ae11d1f8b9bf13567e1b1237d5876bae2862421c18580fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/modules/cloud.ts: packages/cli/src/modules/cloud.ts changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is cloud.decisionsNote at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): routing disclosure names agent headers, OpenCode ids and the previous request\u0027s age\u201D; \u201Cfix(cli): routing copy says it picks the model and effort and sends request facts\u201D; \u201Cfix(cli): setup says what routing sends, before and after it turns on\u201D; \u201Cfix(cli): \u0060caveman on routing\u0060 says what routing sends when already signed in\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/cloud.ts\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":"packages/cli/src/modules/cloud.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d825812d092ec25c71140f54c240d47fb00b896959b91f68699fcb57ea6c84a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/source_claude.go: proxy/internal/store/source_claude.go changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is claudeSessionSource.scanSession at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): separate cold resumes from churn\u201D; \u201Cfix: resolve CodeQL alerts across engine, proxy and JS\u201D; \u201Cfix(learn): attribute gateway-routed Claude Code turns to their vendor\u201D; \u201Cfix(learn): count decoded tool_use blocks, not raw-line name substrings\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/source_claude.go\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":"proxy/internal/store/source_claude.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee438a267da11c153fae965b97dd194495e638084aca2e8f3433ff91587ed904"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/agent-shortcut.runtime.mjs: packages/cli/tests/agent-shortcut.runtime.mjs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 335), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): one own-endpoint check per agent for enable, wrap and doctor\u201D; \u201Cfix(cli): close the gaps around an agent\u0027s own endpoint\u201D; \u201Cfix(cli): respect explicit choices and clear stale Auto choices\u201D; \u201Cfix(cli): the agent door wires nothing nobody agreed to\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/agent-shortcut.runtime.mjs\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":"packages/cli/tests/agent-shortcut.runtime.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"de464123cf30a4719ffe70920d1daa3a2fdd68b07675e2e1330f0d1fc516c239"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/src/recovery.ts: packages/pi-extension/src/recovery.ts changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is RecoveryClient.verify at line 101), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): keep the thinking level when routing, accept promptless turns; 0.3.1\u201D; \u201Cfix(hosts): hide the console window every host child opens on Windows\u201D; \u201Cfix(pi): verify recovery before publishing elisions\u201D; \u201Cfix(pi-extension): keep a broken hook candidate or a dead pipe from taking the host down\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/src/recovery.ts\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":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e871dee2debd3c894c20c735af239b45078924973deb7c2d004e3b3203df1ce9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/config_scan.go: proxy/internal/store/config_scan.go changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is store.scanConfig at line 213), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): honor Pi\u0027s PI_CODING_AGENT_DIR and PI_CODING_AGENT_SESSION_DIR\u201D; \u201Cfix(learn): skip disable-model-invocation skills, read multi-line descriptions\u201D; \u201Cfix(store): honor GEMINI_CLI_HOME and XDG_DATA_HOME for learn\u0027s agent roots\u201D; \u201Cfix(learn): honor CLAUDE_CONFIG_DIR and CODEX_HOME in agent roots\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/config_scan.go\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":"proxy/internal/store/config_scan.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee196ea09c45230bdf0bb1b24317e0a00276c797ee2e3dfbe840e297d753861a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/test_mcp_shrink.js: tests/test_mcp_shrink.js changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is (anonymous) at line 353), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: resolve CodeQL alerts across engine, proxy and JS\u201D; \u201Cfix(shrink): stop a NUL byte in a description forging a protected-segment sentinel\u201D; \u201Cfix(shrink): keep \u0022sure\u0022 inside the make/be/not collocations\u201D; \u201Cfix(shrink): finish the shutdown sequence when the upstream ignores stdin EOF\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- tests/test_mcp_shrink.js\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":"tests/test_mcp_shrink.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe4b2fc5f6bb418184ef130872d0280d7ff5c52ba985817f11d0978852620b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/tests/provider.runtime.mjs: packages/pi-extension/tests/provider.runtime.mjs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is (anonymous) at line 485), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): pass pi-virtual models through without a pass-through warning\u201D; \u201Cfix(pi): verify the compat route for an OpenAI base without /v1\u201D; \u201Cfix(pi): keep the thinking level when routing, accept promptless turns; 0.3.1\u201D; \u201Cfix(pi): name the proxy when a provider baseUrl already targets it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/tests/provider.runtime.mjs\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":"packages/pi-extension/tests/provider.runtime.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"312be6dc684a9969c1048207d0e705e4a94a9cd19256693966e1d6a05bc552b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/sdk/python/caveman_cloud/middleware/transport.py: packages/sdk/python/caveman_cloud/middleware/transport.py changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is HTTPTransport.__call__ at line 210), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sdk-python): restore TLS budget after CONNECT reads\u201D; \u201Cfix(sdk-python): close() releases an in-flight call on Windows\u201D; \u201Cfix(sdk-python): bound every response read by the deadline on Windows\u201D; \u201Cfix(sdk): never crash or mislead the host, TS/Python parity\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/python/caveman_cloud/middleware/transport.py\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":"packages/sdk/python/caveman_cloud/middleware/transport.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec7b25f0d998c3780041a2165f56cb42a91aeebd74f65ae6297c005998b65cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/translate/effort.go: proxy/internal/translate/effort.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is translate.applyChatEffort at line 34), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): map Kimi K3 chat effort\u201D; \u201Cfix(proxy): thinking fitted without an effort; no estimate left over cached input\u201D; \u201Cfix(proxy): relayed pings go only between events; line readers stop on early return\u201D; \u201Cfix(proxy): a failed target\u0027s effort fits the asked model; between_tools only where taken\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/translate/effort.go\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":"proxy/internal/translate/effort.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e75fccb4a0d5a9145e285f384341624e39c6cdc1acc261a139bf437e5697ea0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/gateway/route_cache.go: proxy/internal/gateway/route_cache.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is releaseOnRead.Read at line 326), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): the OpenRouter provider pin is marshalled as one object\u201D; \u201Cfix(proxy): record mode gets none of the cache mechanics; a refused key latches\u201D; \u201Cfix(proxy): record mode and routing-off traffic are never keyed\u201D; \u201Cfix(proxy): second review of the cache mechanics\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/route_cache.go\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":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd7a54f88a8ab4dabc377c19e6cf55bb24eb423d84309dbc4ded52f3b8055f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/ccr/sqlite_file_security_linux.go: engine/ccr/sqlite_file_security_linux.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ccr.chmodSQLiteFile at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ccr): detect Android by filesystem marker, not only ANDROID_ROOT\u201D; \u201Cfix(ccr): gate fchmodat2 on Android so Termux can open the store\u201D; \u201Cfix(ccr): detect Android from the system image, not only ANDROID_ROOT\u201D; \u201Cfix(ccr): gate fchmodat2 on Android\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/ccr/sqlite_file_security_linux.go\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":"engine/ccr/sqlite_file_security_linux.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"440fcfec8a767e399de2b2c458d1da50c50f2c828d5c9df81ab8483f44f77d38"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/status.runtime.mjs: packages/cli/tests/status.runtime.mjs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is statusEnv at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): say when the recovery store stops compression, and why\u201D; \u201Cfix(cli): sign-in says what routing and runtime data do; review round\u201D; \u201Cfix(cli): free account copy; no weekly token caps or seat price\u201D; \u201Cfix(cli): on|off touch only the named modules; honest plans and doctor\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/status.runtime.mjs\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":"packages/cli/tests/status.runtime.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"332d39f23a64e2d22caf7dc62f712e98fc60cff7c73c7f98110dd56daf8f16f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/providers/openaicompat/openaicompat.go: proxy/providers/openaicompat/openaicompat.go changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is namedAdapter.SanitizeAndMapHeaders at line 258), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): forward read-only GET /v1/models instead of 404ing it\u201D; \u201Cfix(proxy): route a dialect mount\u0027s zone grammar through the one path rule\u201D; \u201Cfix(proxy): compat-mount wire dialect for usage accounting and compression zones\u201D; \u201Cfix(providers): strip hop-by-hop headers before adding this hop\u0027s credentials\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/openaicompat/openaicompat.go\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":"proxy/providers/openaicompat/openaicompat.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"10afaac9568fd439af5a9a0d9a41feab560750b8b96f12a266ef1f3c46bd3129"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/tests/protocol.runtime.mjs: packages/pi-extension/tests/protocol.runtime.mjs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): gate provider routing on the live listener, not a run-state file alone\u201D; \u201Cfix(pi): per-model originals and compat-mount routing for custom providers\u201D; \u201Cfix(pi): route only default provider endpoints (#972)\u201D; \u201Cfix(pi): route opencode-go through compat mount\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/tests/protocol.runtime.mjs\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":"packages/pi-extension/tests/protocol.runtime.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73f6402ac33a4c17d07e6a26facaf0bfc3df562b05f8f407a2a5e4eb4ae4a81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/modules/status.ts: packages/cli/src/modules/status.ts changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is status.renderModuleGrid at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): an agent left on its own endpoint is said once and never offered\u201D; \u201Cfix(cli): let status\u0027s next step stay enable for an agent not wired yet\u201D; \u201Cfix(cli): before setup, say a module is not set up instead of failing it\u201D; \u201Cfix(cli): sign-in says what routing and runtime data do; review round\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/status.ts\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":"packages/cli/src/modules/status.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90d8794f2e6360f84a8114c7e8697c58af281d3fe3274dcdf7566d8b2f6d77f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drift-report.mjs: agents/drift-report.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is drift-report.boundedString at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agents): drift report names the one real cause of a broken probe\u201D; \u201Cfix(agents): report a broken latest-agent probe instead of dropping it\u201D; \u201Cfix(ci): bind drift reports to probe lanes\u201D; \u201Cfix(ci): validate drift probe artifacts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- agents/drift-report.mjs\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":"agents/drift-report.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d202564e50f1113e8c024f9fce5cf74532a0054b3b89ad203bd75e1526cedd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/tests/portable-command.runtime.mjs: packages/pi-extension/tests/portable-command.runtime.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): launch an npm cmd shim that forwards to a native .exe\u201D; \u201Cfix(pi): run stock npx.cmd and .exe-forwarding shims on Windows\u201D; \u201Cfix(windows): support managed Pi launcher\u201D; \u201Cfix(windows): unwrap nested Pi command shims safely\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/tests/portable-command.runtime.mjs\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":"packages/pi-extension/tests/portable-command.runtime.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b67670d09e6973a8b9b5abbf5002fd0b62ddc30f782841ecc2b9d0dbe2605cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/codex-subscription-wrap.runtime.mjs: packages/cli/tests/codex-subscription-wrap.runtime.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 253), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): \u0060caveman codex\u0060 wrap leaves out the installer\u0027s voice hook\u201D; \u201Cfix(wrap): route codex by its login at the shared choke point, not per caller\u201D; \u201Cfix(codex): write the api-key route with the /v1 codex\u0027s client expects\u201D; \u201Cfix(wrap): stop registering the Codex shrink hook the README says it skips\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/codex-subscription-wrap.runtime.mjs\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":"packages/cli/tests/codex-subscription-wrap.runtime.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fff65831ed548f2d4411d0c91d9f40d584afc1920e055bfd411e60d049865d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/runstate/runstate.go: proxy/internal/runstate/runstate.go changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is runstate.RoutingUpstreams at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): stop the proxy only with a private shutdown token\u201D; \u201Cfix(proxy): support android executable identity\u201D; \u201Cfix(proxy): three accounting and routing gaps found reviewing this branch\u201D; \u201Cfix(proxy): prove the listener is this run-state\u0027s generation before trusting it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/runstate/runstate.go\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":"proxy/internal/runstate/runstate.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee402bf2590f98af8edcc29a7d103a5a1bf3a2617ee88942d08e6bd7bdda6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/cloudlink/events.go: proxy/internal/cloudlink/events.go changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Link.flush at line 220), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): events follow /me and the telemetry opt-out; route only provider origins\u201D; \u201Cfix(proxy): events flow whenever signed in; a limit pause lifts when /me does\u201D; \u201Cfix(proxy): route stage review fixes\u201D; \u201Cfix(proxy): Cloud calls use the fresh session token, then the project key\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/cloudlink/events.go\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":"proxy/internal/cloudlink/events.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c4d1c8b73c5d126562affda24eb10a4810e7ff8a6bd440189cfadad0849aea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/_modules.mjs: packages/cli/tests/_modules.mjs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is modulesFixture at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): status and doctor say when wired agents\u0027 runtime is not running\u201D; \u201Cfix(cli): setup from npx installs the CLI and never wires a path into the npx cache\u201D; \u201Cfix(cli): scripts runs only a Blocks that can report its hooks, for the selected agents\u201D; \u201Cfix(cli): one line for the scripts step instead of Blocks\u0027 installer output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/_modules.mjs\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":"packages/cli/tests/_modules.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1fd02c0354175f2d9fcbc02ab65d8d5140ab8db13f8851d98151f9f58c58f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/capability-config.runtime.mjs: packages/cli/tests/capability-config.runtime.mjs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is startEnvHarness at line 30), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): read the proxy\u0027s top-level mode, not a nested middleware.mode\u201D; \u201Cfix(cli): name a broken cloud.json on the read side too\u201D; \u201Cfix(cli): read a hand-edited project overlay the way the hooks do\u201D; \u201Cfix(cli): refuse to overwrite an unparseable cloud.json\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/capability-config.runtime.mjs\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":"packages/cli/tests/capability-config.runtime.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83b33821ddc246032b4bacc81c533e2a6b9d9046223b7471b9b77859aacf9b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/tests/recovery.runtime.mjs: packages/pi-extension/tests/recovery.runtime.mjs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is assertAllDead at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): tell the session when the native runtime goes quiet\u201D; \u201Cfix(pi): verify recovery before publishing elisions\u201D; \u201Cfix(pi-extension): keep a broken hook candidate or a dead pipe from taking the host down\u201D; \u201Cfix(pi-extension): close the recovery, hook and context leaks; ship on pi-v*\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/tests/recovery.runtime.mjs\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":"packages/pi-extension/tests/recovery.runtime.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98869d8598262f47024ee0e9097820eb4ac8184dcb7a88d2624d17a469d9e0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/agent-compression-conformance.runtime.mjs: packages/cli/tests/agent-compression-conformance.runtime.mjs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is (anonymous) at line 420), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: resolve CodeQL alerts across engine, proxy and JS\u201D; \u201Cfix(codex): write the api-key route with the /v1 codex\u0027s client expects\u201D; \u201Cfix(cli): give the Codex API-key route the /v1 prefix it appends to\u201D; \u201Cfix(cli): honor agent config homes and keep the gateway out of a corporate proxy\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/agent-compression-conformance.runtime.mjs\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":"packages/cli/tests/agent-compression-conformance.runtime.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9289202048b0d73c8bb904951945404d8c953c323d2df69347b7593061ace8c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/sdk/python/caveman_cloud/middleware/async_runtime.py: packages/sdk/python/caveman_cloud/middleware/async_runtime.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is AsyncMiddlewareRuntime._submit at line 170), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sdk): never crash or mislead the host, TS/Python parity\u201D; \u201Cfix(sdk): Stage 5 resilience and parity \u2014 bounded sync transport, no stale reuse, loopback never proxied\u201D; \u201Cfix(middleware): decline() parity in Python, node16-CJS type shims, compressor on langchain-model\u201D; \u201Cfix(sdk): configuration errors never raise at construction, in both SDKs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/sdk/python/caveman_cloud/middleware/async_runtime.py\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":"packages/sdk/python/caveman_cloud/middleware/async_runtime.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f4ece21ecd7a0ecd25cfac87e96e34256afbedc382a0e75a1befe72348f608"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/middleware/python/caveman_middleware/_versions.py: packages/middleware/python/caveman_middleware/_versions.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _versions._stable_version at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(middleware): admit the Anthropic SDK major in both hosts\u201D; \u201Cfix(middleware-python): Stage 5 \u2014 refused recovery is a tool error, Bedrock keeps its AWS profile, one LiteLLM callback\u201D; \u201Cfix(middleware): decline() parity in Python, node16-CJS type shims, compressor on langchain-model\u201D; \u201Cfix(middleware): gate adapters on version ranges, not exact pins\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/_versions.py\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":"packages/middleware/python/caveman_middleware/_versions.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b5c4447ecf40e921d48e94d479431f73bc9e31da7a5f56ba1be3d1e676c751"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/sync.runtime.mjs: packages/cli/tests/sync.runtime.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is (anonymous) at line 469), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): sync uploads a large span backlog in batches and drops the SQLite warning\u201D; \u201Cfix(stats): keep cache warms out of request counts and uploads\u201D; \u201Cfix(cli): a sync read waits out another process\u0027s commit\u201D; \u201Cfix(cli): lock the local-spend sync watermark across processes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/sync.runtime.mjs\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":"packages/cli/tests/sync.runtime.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"128535627483a65280fb28dda0a73cc48b35d1cc2e431d8504297daa072ead44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/test_caveman_init.js: tests/test_caveman_init.js changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is test at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(init): keep symlinked rule files and never invent an OpenClaw home\u201D; \u201Cfix(init): honor --force when refreshing an installed rule file\u201D; \u201Cfix(xplat): stop the installer and uninstaller from breaking their own state\u201D; \u201Cfix(xplat): stop hooks stalling on Windows; own only our own config entries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- tests/test_caveman_init.js\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":"tests/test_caveman_init.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e478f320c3df91f5295edfb5388599399feca926a63efb1d42101e52e30f90d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/config-file-injection.runtime.mjs: packages/cli/tests/config-file-injection.runtime.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is withEnv at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): honor agent config homes and keep the gateway out of a corporate proxy\u201D; \u201Cfix(cli): match Qwen JSON and merge safety\u201D; \u201Cfix(registry): scope optional credential token\u201D; \u201Cfix(cli): verify effective MCP recovery\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/config-file-injection.runtime.mjs\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":"packages/cli/tests/config-file-injection.runtime.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fd358149c0a9644435676f71499f6e39c99cd49648430f61bc700663157756"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mcp/engine_tools.go: mcp/engine_tools.go changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is mcp.compressTool at line 119), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ccr): free room in a full store instead of refusing every write\u201D; \u201Cfix(ccr): refuse recovery bytes that do not match the handle\u201D; \u201Cfix(pi): verify recovery before publishing elisions\u201D; \u201Cfix(mcp): stop withholding recovery the host may no longer have\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- mcp/engine_tools.go\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":"mcp/engine_tools.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec8f93f86fd866ecba60d45f5e3b2725e3f409372c2884bcb48bd958e1c8d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/wrap-restart.runtime.mjs: packages/cli/tests/wrap-restart.runtime.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is waitFor at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): support android executable identity\u201D; \u201Cfix(cli): honor agent config homes and keep the gateway out of a corporate proxy\u201D; \u201Cfix(cli): fail closed on unverifiable proxy owners, strip attributed routes on direct launch\u201D; \u201Cfix(cli): launch direct when a foreign process owns the proxy port\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/wrap-restart.runtime.mjs\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":"packages/cli/tests/wrap-restart.runtime.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ed00bd22976a606cb0819d8dab8cb5f3654fb54d4763f05063e4de81ea84ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/providers/anthropic/anthropic.go: proxy/providers/anthropic/anthropic.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Adapter.MatchMetadataRequest at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): relay Claude OAuth token refresh\u201D; \u201Cfix(proxy): keep Anthropic and Google keys off the OpenAI models route\u201D; \u201Cfix(proxy): route bare /v1/models by wire protocol, not adapter order\u201D; \u201Cfix(proxy): forward read-only GET /v1/models instead of 404ing it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/anthropic/anthropic.go\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":"proxy/providers/anthropic/anthropic.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d255bdb36c08d07d8700366c11b9dffd765fff509207a6dfd9fac08faf248e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/source_pi.go: proxy/internal/store/source_pi.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is piSessionSource.scanSession at line 68), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): honor Pi\u0027s PI_CODING_AGENT_DIR and PI_CODING_AGENT_SESSION_DIR\u201D; \u201Cfix(learn): read Pi usage as pi-ai\u0027s disjoint buckets\u201D; \u201Cfix(learn): harden Pi source parsing and add fixture test\u201D; \u201Cfix(learn): use constant upper bound check for Pi context conversion\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/source_pi.go\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":"proxy/internal/store/source_pi.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a01fdb25ab8c30571628d9885b069ed13797eedc72be91265b5bc732b3fef6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/compressors/terminal.go: engine/compressors/terminal.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is compressors.elideMiddle at line 156), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): decide the CR collapse all-or-nothing, on visible text\u201D; \u201Cfix(engine): stop the terminal compressor truncating CR-separated content\u201D; \u201Cfix: resolve CodeQL alerts across engine, proxy and JS\u201D; \u201Cfix(engine): stop the compressors rewriting line endings and eliding real changes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/compressors/terminal.go\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":"engine/compressors/terminal.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed82e3eb17c959514596851e9545551cf37b1dc8e85ec3ed2b4571c9c25f6dc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/pi-extension/src/lifecycle.ts: packages/pi-extension/src/lifecycle.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is lifecycle.taskTerms at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): hide the console window every host child opens on Windows\u201D; \u201Cfix(pi-extension): keep a broken hook candidate or a dead pipe from taking the host down\u201D; \u201Cfix(pi-extension): close the recovery, hook and context leaks; ship on pi-v*\u201D; \u201Cfix(pi-extension): resolve the CLI through PATHEXT so Windows hooks can spawn\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/pi-extension/src/lifecycle.ts\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":"packages/pi-extension/src/lifecycle.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d0be8ed715b6b5b7872548cea5ca3a345cb8399a4dce081c925057e94b731b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/activation-rule.mjs: skills/activation-rule.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is activation-rule.activationRule at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plugin): move the installer out of top-level bin/\u201D; \u201Cfix(skills): never delete or shorten existing comments in edited files\u201D; \u201Cfix(skills): break caveman for questions the agent asks, in every mode\u201D; \u201Cfix(docs,rules): act on the release review\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- skills/activation-rule.mjs\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":"skills/activation-rule.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ea79ac21badb00ac6ce7b6ab4af01d563ad4d5d1d7bbcede6297e85303a22f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/learn-savings.runtime.mjs: packages/cli/tests/learn-savings.runtime.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): stop crediting caching when input costs near or above list price\u201D; \u201Cfix(cli): group thousands in learn dollar amounts\u201D; \u201Cfix(learn): plain words in terminal, TUI, trends and nudge output\u201D; \u201Cfix(learn): fold unpriced models into one line in compact output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/learn-savings.runtime.mjs\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":"packages/cli/tests/learn-savings.runtime.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"751c77e3b5019b2b3dfa167f05e786a1a885dcf73910b9ac6e448762fa7dd732"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/test_hook_missing_sibling.js: tests/test_hook_missing_sibling.js changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is makeInstall at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): SessionStart keeps the full rules under a config predating fallbackRuleset\u201D; \u201Cfix(hooks): start headless claude -p and SDK sessions with caveman off\u201D; \u201Cfix(xplat): stop hooks stalling on Windows; own only our own config entries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- tests/test_hook_missing_sibling.js\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":"tests/test_hook_missing_sibling.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"018ab582eb9957e42764c73160cec622b81c6c8c584f9cf13255f1eb54fd6ca5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/modules/provider-logins.ts: packages/cli/src/modules/provider-logins.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is provider-logins.providersAdd at line 167), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: refresh binaries an older release installed and restart the old runtime\u201D; \u201Cfix(cli): keychain calls under the provider-login lock stay under the stale age\u201D; \u201Cfix(proxy): OpenAI is Responses-only; login locks are owned and stale ones broken atomically\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/provider-logins.ts\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":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4747d23402e1c0ad2034bf845efa4dfab32cc32347a10e505125793c6a456"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/middleware/python/caveman_middleware/anthropic.py: packages/middleware/python/caveman_middleware/anthropic.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is CavemanAnthropicMiddleware.eligible at line 71), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(middleware): adapters survive hostile tool args and double wraps\u201D; \u201Cfix(middleware-python): Stage 5 \u2014 refused recovery is a tool error, Bedrock keeps its AWS profile, one LiteLLM callback\u201D; \u201Cfix(python): warn-once line, name-conflict diagnostics and strict ready() match TS\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/anthropic.py\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":"packages/middleware/python/caveman_middleware/anthropic.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77186ea731e162090807e5feaa773d336674aefcacdb3bf9b662feea0e9830"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/detect_cache_hygiene.go: proxy/internal/store/detect_cache_hygiene.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is cacheHygieneTracker.observation at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): sample cache-spike locators per classification\u201D; \u201Cfix(learn): separate cold resumes from churn\u201D; \u201Cfix(learn): use plain words in the report, findings and caveats\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/detect_cache_hygiene.go\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":"proxy/internal/store/detect_cache_hygiene.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24c72d789d2dd3b64888cdfeb796b0892e3e570940277f5f1ce06f1c304966"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/recurring.go: proxy/internal/store/recurring.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is recurringMiner.merge at line 191), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): tighten the hook-result rule and document the narrowed sink\u201D; \u201Cfix(learn): stop mining host- and hook-injected context as repastes\u201D; \u201Cfix(learn): use plain words in the report, findings and caveats\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/recurring.go\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":"proxy/internal/store/recurring.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e5134d97251630663b2b8ac2608827b41c63ee1a31cba56b0fa1ad3ff63e73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: benchmarks/run.py: benchmarks/run.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is run.main at line 301), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): support Anthropic SDK 2 requests\u201D; \u201Cfix: update retired benchmark model (#937)\u201D; \u201Cfix(xplat): close Windows/macOS data-loss, encoding, and hook-budget gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- benchmarks/run.py\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":"benchmarks/run.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ada92249dff6554cb727c7d75fb0708aaa271782b8b90f7f47ae7947d95f33"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mem/py/cavemem.py: mem/py/cavemem.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is cavemem.recall at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mem): send a replacement argv cannot carry over stdin, not as an argument\u201D; \u201Cfix(mem): gate supersede --stdin on an advertised binary capability\u201D; \u201Cfix(xplat): close Windows/macOS data-loss, encoding, and hook-budget gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- mem/py/cavemem.py\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":"mem/py/cavemem.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be0e64b8dad8b19c5e9e066e7e8103fc4766649fbd608867c6108b8bd54f13"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/agent-native.runtime.mjs: packages/cli/tests/agent-native.runtime.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 8), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): write only hooks Codex runs: no PostToolUseFailure, no shrink-hook\u201D; \u201Cfix(cli): only caveman disable records a native opt-out\u201D; \u201Cfix(cli): make the bundle-removal warning name a command that works\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/agent-native.runtime.mjs\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":"packages/cli/tests/agent-native.runtime.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ba590ffd3701ff3036fbd4ce1e5e39fabbf8f76383a0d9141bc647b9488ae0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/modules/index-file.ts: packages/cli/src/modules/index-file.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is index-file.ensureModuleBinaries at line 129), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): move a running Windows binary aside instead of failing with EPERM\u201D; \u201Cfix(cli): caveman on downloads only the module\u0027s signed binaries\u201D; \u201Cfix(cli): race-free module installs, per-module lock, module-named errors\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/index-file.ts\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":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43b082274bf7c651b7fc0d474292a64e288d8a0da3e68c0dcced590fdd3c13d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/claude-profiles.runtime.mjs: packages/cli/tests/claude-profiles.runtime.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is (anonymous) at line 174), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): never re-point an agent that uses its own endpoint\u201D; \u201Cfix(cli): name the config file a parse error comes from; disable skips unreadable files it never wrote\u201D; \u201Cfix(cli): wire only real Claude logins and survive a broken sibling profile\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/claude-profiles.runtime.mjs\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":"packages/cli/tests/claude-profiles.runtime.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da0ce81e686aba37f46e0439c74ba912763eee426c3ce96939824f7d69523a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/prefix_cache.go: proxy/internal/store/prefix_cache.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Store.RememberReplacement at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): scope the raw pin to the lineage the provider re-cached (#1105)\u201D; \u201Cfix(proxy): give pixel rows their own prefix-cache cap (#1105)\u201D; \u201Cfix(proxy): the first forwarding decision wins, raw included (#1105)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/prefix_cache.go\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":"proxy/internal/store/prefix_cache.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc72d48fda1ba5cc4ca7807068a5902ae390a5e4bd37739fec910856b1681ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/providers/openai/openai.go: proxy/providers/openai/openai.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is Adapter.MatchMetadataRequest at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): keep Anthropic and Google keys off the OpenAI models route\u201D; \u201Cfix(proxy): route bare /v1/models by wire protocol, not adapter order\u201D; \u201Cfix(proxy): forward read-only GET /v1/models instead of 404ing it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/providers/openai/openai.go\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":"proxy/providers/openai/openai.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb65c0bed9cb2862a52ee599598baf53d12bcc479e911ee439d54286aa79c4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: extension/src/caveman.js: extension/src/caveman.js changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is caveman.onKeydown at line 267), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extension): snapshot the rich draft after the editor settles\u201D; \u201Cfix(extension): only stop at a form that actually holds the send control\u201D; \u201Cfix(extension): pin the composer selectors instead of guessing at the page\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- extension/src/caveman.js\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":"extension/src/caveman.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc771e39389f4691089b7884a3456e4a0ae9f247f93dac14c91be773cee8f9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/store/learn_digest.go: proxy/internal/store/learn_digest.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is store.digestSinkID at line 179), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): plain words for savings, experiment, reconcile and export caveats\u201D; \u201Cfix(learn): keep named memory_health scopes in the digest\u201D; \u201Cfix(learn): strip memory_health path hashes from the digest\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/store/learn_digest.go\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":"proxy/internal/store/learn_digest.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3485cc1a898eeefb09151f10280b93fead992110edd2f799a6582386a52bcf60"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/filewrap.go: engine/filewrap.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is engine.unwrapFileWrapper at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): guard unwrapFileWrapper against whitespace-only input\u201D; \u201Cfix(engine): compress Codex code-mode command output inside its JSON line\u201D; \u201Cfix(engine): guard the unterminated \u003Cfile\u003E tag that panicked unwrapFileWrapper\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/filewrap.go\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":"engine/filewrap.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6cfd9bf3939b01df8bc8b2ffb101ef264abf33002208e692667289ecd65e80"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/ccr/store_generation.go: engine/ccr/store_generation.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is ccr.inspectSQLiteGeneration at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ccr): refuse writes to a damaged store and check it once per release\u201D; \u201Cfix(ccr): inspect the generation through the canonical temp path in tests\u201D; \u201Cfix(ccr): do not quarantine a recovery store that was only unreadable for a moment\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/ccr/store_generation.go\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":"engine/ccr/store_generation.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f923a1446444c7f3c7f857261bfc1351f1bddd01d4cf7d64a653f389d3a5c636"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/mem.runtime.mjs: packages/cli/tests/mem.runtime.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is fakeCavemem at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mem): gate supersede --stdin on an advertised binary capability\u201D; \u201Cfix(cli): accept supersede --stdin so large replacements reach cavemem\u201D; \u201Cfix(learn): store offloaded blocks from stdin, not a quoted shell argument\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/mem.runtime.mjs\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":"packages/cli/tests/mem.runtime.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"974ecb99075712cd50bac2587ddfbd5b234eb31fca45d13f2cf9d1471d937383"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/caveman-compress/scripts/cli.py: skills/caveman-compress/scripts/cli.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is cli.main at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(compress): match the retry docs and failure message to what the CLI does\u201D; \u201Cfix(compress): refuse credential dotfiles before reading them\u201D; \u201Cfix(compress): make the skill CLI runnable as a plain script\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- skills/caveman-compress/scripts/cli.py\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":"skills/caveman-compress/scripts/cli.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bcde06c1062bf6b1fcaff1e7f3c1357265184ff50a610074bcc4a84507f4eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/compressors/diff.go: engine/compressors/diff.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is diffCompressor.Compress at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(diff): keep a localized no-newline marker too\u201D; \u201Cfix(diff): keep git\u0027s extended headers out of the elided context\u201D; \u201Cfix(engine): stop the compressors rewriting line endings and eliding real changes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- engine/compressors/diff.go\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":"engine/compressors/diff.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d1ccca70715e78918fcdd3a78622b34b596f18defe591357efe04a1703064"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/hooks/cavecrew-model-overrides.js: src/hooks/cavecrew-model-overrides.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is cavecrew-model-overrides.applyOverrides at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): remove the staged temp file when the override rename fails\u201D; \u201Cfix(hooks): write cavecrew model overrides safely\u201D; \u201Cfix(hooks): stop cavecrew model overrides rewriting a source checkout\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/hooks/cavecrew-model-overrides.js\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/hooks/cavecrew-model-overrides.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45535bb786c0b6df6131912489730f0a8e7eae513ff6246f289ec19bdc9239a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/test_cavecrew_model_overrides.js: tests/test_cavecrew_model_overrides.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is test at line 18), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): remove the staged temp file when the override rename fails\u201D; \u201Cfix(hooks): write cavecrew model overrides safely\u201D; \u201Cfix(hooks): stop cavecrew model overrides rewriting a source checkout\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- tests/test_cavecrew_model_overrides.js\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":"tests/test_cavecrew_model_overrides.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c20042be9e2bf5cf5e1d1542cb32d5f98dfbf0d6dc414e4b0ed08dc9f433eed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/plugins/opencode/server.js: src/plugins/opencode/server.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is server.locationKey at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): activate the 2.x plugin one time for each location\u201D; \u201Cfix(opencode): a subagent session no longer resets or switches the user\u0027s mode\u201D; \u201Cfix(installer): opencode plugin entry names the directory both majors load\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/plugins/opencode/server.js\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/plugins/opencode/server.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3b47f6493f84f1511da4e0be5a60fb3aa89931d2cc34dfbe53133ccbb2191d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/modules/stop.ts: packages/cli/src/modules/stop.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is stop.endRuntimes at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): Windows stop drops the run state of a runtime it ended the hard way\u201D; \u201Cfix(proxy): stop the proxy only with a private shutdown token\u201D; \u201Cfix: refresh binaries an older release installed and restart the old runtime\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/modules/stop.ts\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":"packages/cli/src/modules/stop.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69dbf61504eb4247e760e63e124c086baf236de04f2c5d9135284273c2fdc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/agent-traffic.runtime.mjs: packages/cli/tests/agent-traffic.runtime.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is (anonymous) at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): check the port before moving managed wiring to the local runtime\u201D; \u201Cfix(cli): enable re-points a stale route; sign-in reads the stored routing switch\u201D; \u201Cfix(cli): sign-in says what routing and runtime data do; review round\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/agent-traffic.runtime.mjs\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":"packages/cli/tests/agent-traffic.runtime.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3eb9f1522491704cc04f8706d8f4097bf164b9ff64e820e41bd7efc138b897"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/mcp-servers/caveman-shrink/spawn-options.js: src/mcp-servers/caveman-shrink/spawn-options.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is spawn-options.resolveWindowsCommand at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(windows): launch Node\u0027s own npm.cmd/npx.cmd and pnpm .exe shims\u201D; \u201Cfix(xplat): stop the installer and uninstaller from breaking their own state\u201D; \u201Cfix(xplat): close Windows/macOS data-loss, encoding, and hook-budget gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- src/mcp-servers/caveman-shrink/spawn-options.js\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/mcp-servers/caveman-shrink/spawn-options.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"890cd81b3b81d344938b29313117b8d00623dbd8bebb0839d6eb6e189736739a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: proxy/internal/gateway/raw_pin.go: proxy/internal/gateway/raw_pin.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Server.pinRaw at line 149), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(proxy): hold a PAYG conversation raw once it streams (#1105)\u201D; \u201Cfix(proxy): scope the raw pin to the lineage the provider re-cached (#1105)\u201D; \u201Cfix(proxy): let the raw pin, not the session, exempt the tripwire (#1105)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- proxy/internal/gateway/raw_pin.go\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":"proxy/internal/gateway/raw_pin.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd5cce3ed6d70e5c930c5fd9f663d6127ed12a39ffc7d6dbc9cf53095e0eb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/tests/learn-trends.runtime.mjs: packages/cli/tests/learn-trends.runtime.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is (anonymous) at line 25), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(learn): plain words in terminal, TUI, trends and nudge output\u201D; \u201Cfix(learn): label nudge tokens inferred and caveat compact trends\u201D; \u201Cfix(learn): compare trends on the last complete ISO week\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/tests/learn-trends.runtime.mjs\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":"packages/cli/tests/learn-trends.runtime.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a970fce8d86f7073e4aba7c810a6ecb89ab6691398822e66cb270f55880e21c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/shared/binary-installer/installer.mjs: packages/shared/binary-installer/installer.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is installer.ensureBinary at line 175), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(release): verified releases, fail-closed installs, honest docs\u201D; \u201Cfix(binary-installer): give each download its own .part so concurrent installs cannot cross\u201D; \u201Cfix(xplat): close Windows/macOS data-loss, encoding, and hook-budget gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/shared/binary-installer/installer.mjs\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":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82bdb68dcaa7ee3aef41df0315ea2b1348e31b0cfab6537d7853f9bde102184"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/middleware/python/caveman_middleware/_guard.py: packages/middleware/python/caveman_middleware/_guard.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _guard.resolve_scope at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(middleware): adapters survive hostile tool args and double wraps\u201D; \u201Cfix(middleware-python): Stage 5 \u2014 refused recovery is a tool error, Bedrock keeps its AWS profile, one LiteLLM callback\u201D; \u201Cfix(python): warn-once line, name-conflict diagnostics and strict ready() match TS\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/middleware/python/caveman_middleware/_guard.py\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":"packages/middleware/python/caveman_middleware/_guard.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde05fdcc199b65f1b416dde388c23fec1905fe99e76b7a6b9c8dfbf60ecd4ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/proxy-fetch.ts: packages/cli/src/proxy-fetch.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is proxy-fetch.sendThroughProxy at line 184), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): fail closed on unverifiable proxy owners, strip attributed routes on direct launch\u201D; \u201Cfix: close weekly review gaps\u201D; \u201Cfix: harden weekly integrations and prepare v2.4.0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 07:32:44 -08:00\u0027 --until=\u00272026-11-13 07:32:44 -08:00\u0027 --full-history --no-merges -- packages/cli/src/proxy-fetch.ts\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":"packages/cli/src/proxy-fetch.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab200ecfc186688ca661d4656748dfd54b83b4eac95fa939dccf97f7f4423e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Extensionless files (like CLAUDE.md, TODO) \u2014 check content \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/caveman-compress/scripts/detect.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"107bb66a7d9f778652893aeb8348a4b9785eeb5a36ae606100c3504c3a5cfc19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Extensionless files (like CLAUDE.md, TODO) \u2014 check content \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd50cb3e61378eb1b5ce6f48d6b0659c157fa9fee9f138c745cdcf695d01750"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060durationMS\u0060 spells \u0060MS\u0060 where 29 names in the project spell it \u0060Ms\u0060: 29 of 31 names in project caveman-installer spell the token \u0060Ms\u0060 (29 of 31; unit: names in project caveman-installer containing \u0060Ms\u0060). Peers: device-auth.generated.nextDevicePollIntervalMs (packages/cli/src/device-auth.generated.ts:28); device-auth.generated.nextDevicePollIntervalMs(currentMs) (packages/cli/src/device-auth.generated.ts:28); device-auth.generated.requestSignal(timeoutMs) (packages/cli/src/device-auth.generated.ts:65); index.acquireClaimLock(budgetMs) (packages/cli/src/index.ts:1438); index.acquireClaimLock(staleMs) (packages/cli/src/index.ts:1438). Rename to \u0060durationMs\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"6298fb419aa4c911fe8547436eda9b64a6ce4b8ea58f103b2683cab8a7455ebe"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060agentMcpTimeoutMS\u0060 spells \u0060MS\u0060 where 29 names in the project spell it \u0060Ms\u0060: 29 of 31 names in project caveman-installer spell the token \u0060Ms\u0060 (29 of 31; unit: names in project caveman-installer containing \u0060Ms\u0060). Peers: device-auth.generated.nextDevicePollIntervalMs (packages/cli/src/device-auth.generated.ts:28); device-auth.generated.nextDevicePollIntervalMs(currentMs) (packages/cli/src/device-auth.generated.ts:28); device-auth.generated.requestSignal(timeoutMs) (packages/cli/src/device-auth.generated.ts:65); index.acquireClaimLock(budgetMs) (packages/cli/src/index.ts:1438); index.acquireClaimLock(staleMs) (packages/cli/src/index.ts:1438). Rename to \u0060agentMcpTimeoutMs\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22703}}}],"partialFingerprints":{"codehealthFindingId/v1":"5049203186f04074ed2516f7c19f1c751d6b305adf74de7e238fbd45f8549dec"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022OpenCode reads $XDG_CONFIG_HOME/opencode and prefers opencode.jsonc there.\u0022 repeats the code it sits on: 8 of its 9 words (open, code, reads, xdg, config, home, opencode, jsonc) are already in \u0060test(\u0022enable opencode writes where OpenCode reads: XDG_CONFIG_HOME and opencode.jsonc\u0022, async () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/native-enable.runtime.mjs"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9966a57c5eb8552b4abd564e45b6b98f9572dbcd116d926154fc7783e247133"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Gemini: the shell\u0027s base URL, and the one in ~/.gemini/.env.\u0022 repeats the code it sits on: 4 of its 5 words (gemini, base, url, env) are already in \u0060const gemini = await wrapAndEchoEnvJson(\u0022gemini\u0022, [\u0022GOOGLE_GEMINI_BASE_URL\u0022], { GOOGLE_GEMINI_BASE_URL: \u0022https://llm-gw. \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/wrap.runtime.mjs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8d632d2aa1192aa3c9e4976775ba4c121491df5365a7a57a750a1b4d55956c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022cave.toolSearch() is the direct variant\u0022 repeats the code it sits on: 4 of its 5 words (cave, tool, search, direct) are already in \u0060const _directReturn: Promise\u003CToolSearchResult\u003E = cave.toolSearch(catalog, \u0022find customer\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/tests/tool-search.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e921f2696fb886a1a68a8530ad97a4230b2fa8ec4dfbea034e059264fd20baf8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022end run()\u0022 only labels the closing brace of the function run. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2476a19583ffa4a33df2c9227d5ff5036cfcaeef37802f3fc5f245481520e142"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 19 project(s) overshoot their size bounds, lowering Project Cohesion to 8.9/10. The most over is \u0060(repository root)\u0060 (94594 LoC, 464 module-visible types across 75 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":"D27","level":"note","message":{"text":"Pass-through layer: CavemanStrandsModel: all 3 public methods forward their arguments unchanged to inner and add no behaviour \u2014 an extra hop (and usually an extra interface) to trace through. Call inner directly, or give the layer a job."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/strands.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12614657efa8b470dd987a13a9d8e941506832a8c8af26731dfbeb6565e123"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0776923c89529f5b54ced990b5efdbcceec358ca1a44cc85128cadcb3c517ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"f74789179595e20cb100fbb5d61964db7f0817311cb421273edf4781b3a85a8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"68062b1767565a17bc5a61b67b00a8d5a5ea4373792f1e904aecdca446e59f1c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"5028f857ffd13e131ed512b404b15e87afc93e0f7db12b5e907fc3ce055812f2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"629b5810dd0fa46f3bb0e9391d5111ab2d06732bf38802403631bb1680815e66"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"e2ccf0969985b7cdaa9c99b7f22d65386896c1e514213c6dfe3c295fa3a1554e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"0c0f86a4fac4ec1bc294312a0fbe4faea7adadaf7034beb605cd85114064402b"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"56b0f646d875ea796301519dcbd0efad85cad181c3ed3aed6fa33a8767293c8a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"5ae17272f53c0ae43537be3153b393711df9e38a78c3ab014c6dba6b3bd8a9dc"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b61e2c51c39bb0ab1c5af0aa9bc9e8a9ec2c9e4d117e28a9494300537fcea21f"},"taxa":[{"id":"CWE-354","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-390","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"ceb42d674b2da4c05be5aeb983240176611003401b8a706e4c44a7a6a52886ad"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a290b64fa32e09396747bd4946d08320744334e6b642192797309f5ee16c417"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ddb590beec18b298a77cc4cf22741f932e15c930c5976d9640ee0751815e1482"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f8ad214f39b6f0a72663d5dd6151f872284609a74b80e3dd5a668aa416196a77"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"de8a03509cead20bba1667d4435c3d500985662bffae4c46d4b02037ce406de9"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"9998a9769e2b89dd21b3ad4fd9cf9f7c8010dc667cb5b2658bd977227c3c052f"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"6c7624c3e79d5a530fbc118aaf420a5ca26165d507e5702ce34d9cd06d01ed1a"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"0eab1fd60abe3b84139ff0cd1d9f5a1aa90aa24753891ad97dbc39579e48d819"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"bdbbd9b4881c40fd0060fcb6e4cc18795f2918d10e45a849ce9a55b1d8e25ad3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f95191a5b6ca07129566bf6ca6776d16126a661aedd0879602223e9b8923ca2f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"d176ab40e83f0115a353b0b672d480dcfad659e9ab655c721c25a742d91f755e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"d8b9dade5ef3f120ce4e7bee8bfa8fda3bdf7336081d8ce1050c696234ef541e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"a392a7bea13598b2cd2339944a13fc0242082b982840be0ebaf7e22d5197a89b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f8e6d665b02c2c2324af55831eea3069a2091adeec8b2feb099377d4149f7fe6"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"ef0cbc97da40490b8b412e7e392f5f8f2e40071f2d7a4110da8614da41e98319"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"6989377598f6bbac64ab2aa04e2baf6f18d4ad57969b1455e33818c11655c0e0"},"taxa":[{"id":"CWE-665","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-908","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"024dd6e84e35c1409704117062bb3134e90a1b982bc49203042bbfab4372b151"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f8f58d1c98f3df286b5a7ebae08994147b21d61137d88b510b4de273b427b928"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c93c145400db7dec9cf47272297c6f7fced7147cbecce9e079bb725d1d323a34"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"69675985b00848dabc0be8ac4130cfb8eecd1fa39b1747ec7cd7ad3e9ecba22b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"807363f9a714a2e62b3cbf4badae31f1583e0dacc997f74be7898f8d1ecdfa7b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"70b573e85063c4f3c1febde38931d0ab60337c653f6a5cf3ebd31c2c4a184539"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"50bc3a1f046d6535dd01e5d25e9cbb0adf92454e4aff3ea308c3d85a0c37371c"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"571955fba50acaed025c96503bbdc02b76d0c30d4b7bd320cfc83c940f0e3103"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"652fa79f5d34ad5daf79e5b05f4eca55547d20eb994e5254a4739fc490d1cb5d"},"properties":{"dependency":{"package":"@modelcontextprotocol/server","version":"2.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2eae5ae78d85cd537b0fb3020ddcfb60e7b62739c2b4fe6fee05aac434877c13"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"8cebd965383fbf6ec5aa075ac5961d71615ca803fb60541206693fa7a1c8ca18"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"685cba4514570b53bf9bc85812fa54c07fec7b3f62fc67d4712c038e9ec2e605"},"properties":{"dependency":{"package":"js-yaml","version":"3.15.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f3d637a6d78cba93aa90ab92103baaf225bd4f5156c98591b41dc9cbc4f070b3"},"properties":{"dependency":{"package":"undici","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"bf90cd24bf9e84fc0fec356b814892d540ad6845363e1267177f28e673cb52f3"},"properties":{"dependency":{"package":"undici","version":"8.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"af3a18cf730f6276ad50ac81337c95bc6659e9de68697e5d39209e4ecd015b5a"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"71d2353be6ae9ad33924aa19cab8701da1730b7e9eb6a238769b0600104b8c4d"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1c98218c53b66c56892158d62ebcae19aa07e801c5aaf0163dc1041e87914931"},"properties":{"dependency":{"package":"@hono/node-server","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"fba88c88c0f4da8eaa88b0cae886b4acc3bb4f750dd875a1809e63c9a06776ad"},"properties":{"dependency":{"package":"hono","version":"4.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"d10c79b7ba192f2bf3e9d396706548fd35619089ac0c9053c2f32644873e24c7"},"properties":{"dependency":{"package":"ip-address","version":"10.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9fa903053a3f312606416859cb67a9d184205be1a801337492ae8f642ebf9203"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"b208e10cee76e2a4474f05c457f823768b78651ec0b46f138cf07051edcdfbb5"},"taxa":[{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"985b0606b094a1b3a5aee186db4b3f9862897f4b1e218eb9543ec86bdfb6c6e0"}},{"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":"7d1cc08a88e29afe8caf1e89dc40b4d885e748102d0db04e758fbe6bf5d0ecbc"}},{"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":"b3f1f06f05e7c9349b3a7be8cbecf1832876e8f99a459a0af8b6bb5451732368"}},{"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":"f48f7d521d807f6f9e3d04024f4a7a8c34b841eceffe0eabf7d24f9a57f3d719"}},{"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":"5e663713ecf566ec6fe49ece6822ad1e28078c610fd53efe909511f0c63af217"}},{"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":"7af9e37ab7227a528b6f790c6e19a0bca0af8278e7827d2d8e8647935d662530"}},{"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":"f6bfa0bd09b9876c04730c1f5aaf0b0611b147fb8ea96d0c77f742c294d22a6c"}},{"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":"b6b86419ef329d198340aa8eeabe6d60293da165cab7e4ef3b4a480fbf4c44ab"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"adcf7c510bb74680c96287b4dfbed80a50381c9a8882f5d1d9adffe6c498147c"}},{"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":"e1783767b5b32102c913d33305efdb6800224e94b2e49727bf676f579c455f12"}},{"ruleId":"D31","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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D31","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":"9e5cec7e32eb4cdda6274f0e87dd31a110bd4c49b2e98e72606fe1a27171a38e"}},{"ruleId":"D31","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":"7d674b4bd266606c51782bb1afbf7cff79ecf63a520ea68de6c4a9a9ab4a5704"}},{"ruleId":"D31","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":"c57c2be76646a6649c672ec79438561e385d14a5fd4806dbc85f8b6dc952fb54"}},{"ruleId":"D31","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":"990966291eec55956dbe10645e02435667c7c209072ef2097eef7846fd6564ef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 323 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 323 of the 389 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: evals/plot.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/plot.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da199f1936642cd706a51308bbe3df970342878112b6674addcfa4def1563e2d"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D42","level":"note","message":{"text":"No runtime threat detection: No runtime threat-detection engine (Tetragon TracingPolicy / Falco) is committed. These observe process, file and network activity in-kernel and can alert or kill on malicious behaviour a static scan cannot catch."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aade9827a37dfc7ee064f80a997f47b5d11e31bc09704e26b9252bef00aa0c58"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa1e8b0abb3235c61cd4ec76238223315bc27dd81b7885c408a0553730b40eb"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30ab63e44a29d595bd630a30fe737f64481fbb3836c805c9f6ea24d13167f70"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9909a8f6e767ab53ede55848eb2d560fc4078f9536813fb76435cf393f182944"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/compare.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec08e20a8375b5d11f0718adcaca0b0f9b9d6e3c3171e628b33ec79331c47a1"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/compare.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f6678f64483b2c50f3a6049d4827b3aa2262a23d65a27d51afb04db0c6a73"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/listing.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"733e12cce0779df6c951d3d46f2cd1fc6f5d88aa403ee2a9915d0d1417a5591f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/listing.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3301b6a2094dbf25124635402e9a92b1bdbbb9a9ae567656c53f3f1d956f831"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/listing.html"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa6e546c3a2dad414e3d4945a1698e78a7df5b1894e6178b6158509c8b30e1"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/promo.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ab4b33db4235b36df3cac9ae68ad40cf4e08b76a0aa2e85a8f04bd6453c7b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/store-assets/promo.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b22795bccd4bcfa67e7f1b8c40de9f63c56842eef893d73dcebc94e509c2513"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.slider::before\u0060 moves (\u0060transition: transform 0.2s cubic-bezier(0.22, 1, 0.36, 1), background 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.css"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1fc06b33ccb07078e1fdcca89d1537abd10faa215d90d2aee0132add63228e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.review\u0060 moves (\u0060transition: background 0.15s ease, border-color 0.15s ease, transform 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.css"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b808df7c33ba65ad966ceddd14a05d35f94ce845a1b781974f5df79ff07ecc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.review .review-arrow\u0060 moves (\u0060transition: transform 0.15s ease, color 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.css"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d33d1efaa4ec0980337199396af0a9222fb1ddae80c876d69e74fd12a67c3e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#caveman-indicator\u0060 moves (\u0060transition: transform 0.16s ease, border-color 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/indicator.css"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"481c47f61a5b61f7c17a06a125508eeee20918b748e991cb1e8ab33619b9e5fc"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060tests/caveman-compress/project-notes.md\u0060, \u0060tests/caveman-compress/project-notes.original.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/technical/provider-authentication.md names OpenAI 1, but the manifest declares \u0060openai\u0060 7.12.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/technical/provider-authentication.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efcce28087b1b9b6ec1ffc3b1915d86a6ec1fc0c9f92770f75866cce381a914"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/10 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060browse\u0060, \u0060mcp\u0060, \u0060packages/subagent-tax\u0060, \u0060shrink\u0060 and 1 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 33 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df1fb1f0d4b9183667245c693e62cf5f006ff91cd3d35ebd010f4ba17275178"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 257 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b73e738a39651796e7df49944e6088ab66424c3f2368c46d6d20fced7e5bfb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 276 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"879e76cb1f52e03d5b2d39e45a6487d0c7726c01bfad5dd6985ff8bf6bb2992a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 289 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6161d3ab4a7f0df25c24d99c82e490af9f778d409d10cfd07012f8e6deb1d603"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 295 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb6e083c956fc7fdc6204897b80c6a9bccf6189d1b1fb0d20c209c9b637c36a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060skills/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 297 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2739fc8eeff641a8b044204fd19b6c510e233df07042af61f727d3e1d46a49"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060integrations/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/compile.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48fc86ecf34e8fd08135be7c1b4f2cc02a476c9ecac383a8dc6347878fc6c58"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060integrations/compile.mjs\u0060 reports through \u0060console.*\u0060 at line 184 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/compile.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2ecb2a0fb47ceed5c14d2a313e57996b335273c8f2329131558cdd6e046754"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.Client{\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfb317d8362c439aa63d493f893f1d8a5164a1bf79666039e5f33255a1a12d1"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.Client{\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/ssrf/ssrf.go"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7128e0e61ac0192bd57ecb96646014b275e07226c5c0c29042e066e30c68da85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c7c44580e70e4897880a6aacc5e298984f70295925e2a7b572c828c2e3cb11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b5914ab803a936b22ff104df3ca1f5d858fe9214075eac4c515f2a1ca5f94d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"852a53fceff51bed4583cd55f86fde10b583dbbab974845821f6a857355a900e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060cpSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9e44e0ce121e0bbe1b028a35530924a39024c8a7064d549e8e03dcb0bdbad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e391b010df2f1d88fdd6508123225571b5f0570181d384def4cf2ce5ef356e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a91340217e0ec6efaa98703b4a327eb9b1e4c8558afb209c6cf5b885969081"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c687dceebddff973fd7ba4cb15b4f7f6206d8ce08a304b0da6bae2f8227edd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"30352731d4e7a9a772677c09d88826724e4a1108ff8b913dfee9b407d6ff8715"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74aed76b0f7cc0c94ce3c8f52d30de7213394754d5dac9bb6a4ebbfc7392b3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"324af247e0a32b8526071415de6dc0e5226d7714f686334f43ebf222630877e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to providersAdd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d160bbb48e7db33f5c19b7ac1bb1e7e783541ca725e6956ca30f93e2d1b623"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060skills\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a0f01c6cea2254298f1c955ae0e4c5be5ceb446cea2db08fd7e4902e4b697"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060skills\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3fd634b24025592e759c53f9df4950c3a76b7902c65056931f6ed7bc2ae49"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060setupInstallLocked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a093a4253b5107d606079e327e1cd23fc6ecaf9166ec23ab71f6e513e99571d7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060setupInstallLocked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"143a4f50cd6c870b7b1d03ab3b5c2eaa3b16bf4b5f3606e42ab8113481e27a74"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060setupInstallLocked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fc1e327bdfcb7fa1e9b160e1d3230dfd9be8d078a1da8c3947ed50c6fe0355"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa8ee9f32e2b0d2aa892fe46154787198af16d2ddf42e54f7f411593cc9f94a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5474f904a4bda248f5694d19a779ddc82ca5a745830198ae60a9d8760ea877bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060agentShortcut\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6439}}}],"partialFingerprints":{"codehealthFindingId/v1":"778179f5d5385737a3108c4977886f2d07a701bc2f5b883ebc13d6de84008791"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060agentShortcut\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8368513e7e9f1476db54dbcaf9dcf89a61985d01593f4aa939259fed26190f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060syncPendingLocalScan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13460}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fd02c4107d8611bdcf56306ab0af2bac2ec9f43660c1c5b60ebd2df2d9bf7f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060syncPendingLocalScan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13461}}}],"partialFingerprints":{"codehealthFindingId/v1":"069311576d0d73a583c660525a8592b681dd09220b1b88a8594e48279628b182"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060syncLocalSavings\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13528}}}],"partialFingerprints":{"codehealthFindingId/v1":"57227865c94b0cbeb9da51b137160d26b37adcaaa358a7af26478980b3a630a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060syncLocalPracticeFindings\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f023be5730d4b073479ea93cf75abfeba6925d3e2e7f8821a73449b610b1ae79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060shrink\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660e89a1fce0780cdee865de054a8996a224eced3c17a4383b9d9dfdc7b8e75"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060writeRawConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22872}}}],"partialFingerprints":{"codehealthFindingId/v1":"2433926063fec9ea6e04530eb6a99698483cb3e7536bdf8279d56b8351b38824"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planModules\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0b7a26d6d2a2a8552e6a8f10332baf946971e75c6e57e410af205231d0b44b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060ensureModuleBinaries\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff07500337ba3c2ae09231ec525cc4b382f0d757706a3f30a84e5d7d407fb16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060ensureModuleBinaries\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d08b59f5a8bfc8989e20f6b0b585a45883a17295d4f79c0d3a7e53898997862"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060endRuntimes\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/stop.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3f98bca49f2df9fba33bee64170ef0bd9af8e45fcb6817ab13a74a38cc12f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060endRuntimes\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/stop.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5fd45271d03d75fac364b37931d65631a2757ce2ea0072ad8f78e5f274e483"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060replaceWithRetry\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86e32f3dd056b61a369768d815e928c04c6ef71dd783375a7747d7640acd10c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060ensureBinary\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96838c5ff0c9f2b52f5fdfba315c1f73127f02877e3b325e5bb462cad1bb3c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060ensureBinary\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5405cf270da4db7bf4054b108cc7ce492711cb4694da563fb6ba32f1763ae7e"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 70 typed \u00B7 357 plain JS \u2014 the untyped files are agents/check-profile-scope.mjs, agents/compile.mjs, agents/delegate/caveman-delegate-mcp.mjs, agents/delegate/portable-process.mjs, agents/delegate/portable-process.test.mjs, agents/drift-report.mjs (\u002B351 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 9 sibling directories (11 clone groups): 11 duplicated blocks under the repository root have copies in at least two of the sibling directories agents, browse, installer, integrations, mcp, packages (\u002B3 more sibling(s) not listed) \u2014 10 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/bin/caveman-browse.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7db02d084e9dea9cd00def62ac465baa53d671ae6f51b987951a9971342628e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (7 clone groups): 7 of the duplicated blocks reported below have copies in at least two of the sibling directories cli, pi-extension, shared, subagent-tax under packages/. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23347}}}],"partialFingerprints":{"codehealthFindingId/v1":"88618a84540f3fe5c309662f185e2813c92debb5a3d68e5461b19bab63cb9b54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): supabase/functions/blocks-telemetry/ingest.ts:40 \u00B7 supabase/functions/cli-telemetry/ingest.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 457 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da3500a8e31b517651afbbf5040860a18ddb9f41d6f5673907b8b022ae87d0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): browse/bin/caveman-browse.mjs:12 \u00B7 mcp/bin/caveman-mcp.mjs:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/bin/caveman-browse.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6615037996827dd19b0bb2e0913fb31457aa6277600dce3a4b520759488253a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (42 matched lines \u00D7 2 locations): installer/lib/portable-process.js:6 \u00B7 src/mcp-servers/caveman-shrink/spawn-options.js:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 375 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/portable-process.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"849e44e917891dcf3a31602ea89e27f6751cec31ffc65e537fdab9faedbf7309"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): packages/cli/src/index.ts:15110 \u00B7 packages/cli/src/index.ts:16398 \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":"packages/cli/src/index.ts"},"region":{"startLine":15110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79d483d9f82d083e6768bbd7785d8ae0d28615cd58a7deb272401381e76f57c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/cli/src/index.ts:17691 \u00B7 packages/cli/src/native-hook-fast.ts:228 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c7ce4c954056a43768e5dde46a4ae636274fa21eb557d557d477d1d9fd3538"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): supabase/functions/blocks-telemetry/index.ts:19 \u00B7 supabase/functions/cli-telemetry/index.ts:17 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"197987062c64e02f9aef91f681cc9c825925138a185c2c2d058020e92f85e677"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): packages/cli/src/index.ts:17747 \u00B7 packages/cli/src/native-hook-fast.ts:277 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28dd558770cbc7323ff4f82e823af95c08b569da6092ccbaf3a0049f6c1646c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): agents/delegate/portable-process.mjs:74 \u00B7 packages/cli/src/portable-command.ts:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 285 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aafd7946b5847a6c02e1e35bf292202cfabdf8d013f5ead3092048ee18087c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/index.ts:7337 \u00B7 packages/cli/src/index.ts:7384 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35b23b59cef9ec427144de898d254240a8c6632ba75ea0d807607d7e04ac5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/index.ts:23347 \u00B7 packages/shared/binary-installer/installer.mjs:38 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0253fcc586f08e7ee7256aacf1b4e4b093117f6277ba89bdcd6cf3a115cd71e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/hooks/caveman-config.js:276 \u00B7 src/hooks/caveman-config.js:396 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ee21bee6c7fcc657598c05158a7432471ee437bc2e65244818b54ca63ac2f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/cli/src/index.ts:17645 \u00B7 packages/cli/src/native-hook-fast.ts:180 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88ec507dec4a8f9b5a135856bbd7ee393056f4b6c0418d7660b4976f8be5605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/cli/src/index.ts:18360 \u00B7 packages/cli/src/index.ts:18390 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c6a1a4a69767ba2fc8dadd42bc141493402f5cfce3acaaed41f12ca95bb42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/cli/src/index.ts:6520 \u00B7 packages/cli/src/index.ts:18092 \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":"packages/cli/src/index.ts"},"region":{"startLine":6520}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d4281b20a9eed901ba64e61f73ebcfe672de3eca0ee590b780fa7bbe3e3ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/cli/src/index.ts:17598 \u00B7 packages/cli/src/native-hook-fast.ts:159 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17598}}}],"partialFingerprints":{"codehealthFindingId/v1":"7124de6e339f92104d1e91a136e443e8169b2a642d2e4036cdbeb23f5ec2ffb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/cli/src/index.ts:14711 \u00B7 packages/cli/src/index.ts:19257 \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":"packages/cli/src/index.ts"},"region":{"startLine":14711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca433e7190360a6fb250c92890a9a81476dc2260b3e6ccf45232ae144190dece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/cli/src/index.ts:19136 \u00B7 packages/cli/src/index.ts:19159 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19136}}}],"partialFingerprints":{"codehealthFindingId/v1":"391231df81819e554a28a01409255730b18c1e9bc1a224d8a53810d2c969feeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): agents/delegate/portable-process.mjs:15 \u00B7 packages/cli/src/portable-command.ts:87 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6196ffa9d981d21a1fca7a9c53b360a0c8399ba3a3f24eb563cda91485c19886"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): extension/src/caveman.js:303 \u00B7 extension/store-assets/flame.js:11 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"536cb35a234edc6dfab4e04159ba49f4e413e457c554e80c734f9c519c27dcc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): agents/compile.mjs:201 \u00B7 integrations/compile.mjs:61 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99e05bdf34795b3dd6273ad2b28af8be2fbff711d3b2a7c539d714517eaeed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): installer/lib/settings.js:303 \u00B7 installer/lib/settings.js:411 \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":"installer/lib/settings.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"135e02e5d7fd41d3c500b75903c07ec7fc364605f848ecc551b5d4d438a8ff50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/index.ts:3450 \u00B7 packages/cli/src/index.ts:3469 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc6689fdff3658a838f41339c3bdc620c1100e3f40fafce959d3525c49c0fed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/hooks/caveman-activate.js:76 \u00B7 src/hooks/caveman-config.js:45 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"53978d5bbd57f8c81847c81ce29eff3a8da7042d4d32b7b94abf2484a7980ba6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/index.ts:17789 \u00B7 packages/cli/src/native-hook-fast.ts:314 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17789}}}],"partialFingerprints":{"codehealthFindingId/v1":"406e389f9c3b3539b628799faf7276209d7a07b8d563506ff25da8f114d0ccb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): agents/compile.mjs:538 \u00B7 integrations/compile.mjs:133 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"735814a520c67a1f8ea374ddd8031ef8cbc476b85b4131afbcb243de84620958"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/index.ts:3038 \u00B7 packages/shared/binary-installer/installer.mjs:103 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3038}}}],"partialFingerprints":{"codehealthFindingId/v1":"242f916e1cd7abde799b302f4fe18408965da70e159d3fd759578a8a6457cfcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/index.ts:11080 \u00B7 packages/cli/src/index.ts:11104 \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":"packages/cli/src/index.ts"},"region":{"startLine":11080}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8bfffa01459c11ae81389a393ff7d2f91ea6ab10f26e2344ff400cc65d5edd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/subagent-tax/lib/analyze.mjs:25 \u00B7 packages/subagent-tax/lib/analyze.mjs:51 \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":"packages/subagent-tax/lib/analyze.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af57e27efccdd49b8939f8cd19597431a38ad2a78e3726c94cbaf0b77b09260"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/cli/src/index.ts:14663 \u00B7 packages/cli/src/index.ts:19139 \u00B7 packages/cli/src/index.ts:19162 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14663}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63e5941020dcf34541b6e92643ae4bb567bcbfcdab97b0c103d00edaa19793"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/index.ts:18459 \u00B7 packages/cli/src/index.ts:19354 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8224cc2be518b5d9eebfdcc1d8fddb9ab515e08839bc573ac70e9a1676cd79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/sdk/typescript/src/index.ts:1882 \u00B7 packages/sdk/typescript/src/index.ts:1894 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a2b0df2f69e73471685ac62ed7d09d809ea6caab591cc574fbd99143cbbd65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/hooks/caveman-activate.js:34 \u00B7 src/hooks/caveman-mode-tracker.js:17 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c968fbca9c172cf1aad351b8b570371906a286ea4fb84c13981a987a90b821b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/index.ts:17677 \u00B7 packages/cli/src/native-hook-fast.ts:215 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17677}}}],"partialFingerprints":{"codehealthFindingId/v1":"60512e92e9361eb357caa6d93c51df3870982fbd0f89324617e7803530b8cc8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/index.ts:17828 \u00B7 packages/cli/src/native-hook-fast.ts:339 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17828}}}],"partialFingerprints":{"codehealthFindingId/v1":"14924fbde1fd9b9970cd3991db297bf92cef5a075a5c395cf1ec630408b66e14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/index.ts:21094 \u00B7 packages/cli/src/index.ts:21122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21094}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a97c56ee64ca7a404336dc377ffe08f9e7906eb87cdda34411efa0ae32a5254"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/cli/src/index.ts:2752 \u00B7 shrink/bin/caveman-shrink.mjs:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c150958cbf26ab4a75108f7cd41e37a27db86b996be58e57507d9b45d84e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/plugins/opencode/plugin.js:62 \u00B7 src/plugins/opencode/plugin.js:120 \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/plugins/opencode/plugin.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabccdff6c413328e1e3f9e0ab30b5ed24ce23798e27c41d0c03c3fe9964a417"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/index.ts:1935 \u00B7 packages/cli/src/index.ts:2546 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"140b7318c6c201d1710eb2ee9b3cb51022480a90e3754cea04631e83043f56fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/index.ts:8604 \u00B7 packages/cli/src/index.ts:8657 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32f2d5d3296e27a02573d1364e09e224eb5ba6071d76dc8c3a89e586bd950b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/cli/src/index.ts:11036 \u00B7 packages/cli/src/index.ts:11075 \u00B7 packages/cli/src/index.ts:11099 \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":"packages/cli/src/index.ts"},"region":{"startLine":11036}}}],"partialFingerprints":{"codehealthFindingId/v1":"428b9e48265b00f209d2b8c6cc91c5d0771b85083d5aba99c2ac08eda8a76cd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/index.ts:12758 \u00B7 packages/cli/src/index.ts:13402 \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":"packages/cli/src/index.ts"},"region":{"startLine":12758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9576eb6e9ac8f0a5c40d1cff2a0bb198325fbf013b5f8af12b48b1a2d01425ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/index.ts:13421 \u00B7 packages/cli/src/index.ts:13730 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93c4cd4bcff17cde88c974d31a09941a461124c369b9008feca319a8c841afe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/index.ts:18072 \u00B7 packages/cli/src/native-hook-fast.ts:454 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614bd50ff9150da2beb40f17983e8edceda7b2c01d34b6ddc1f87c96cc9e2e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): agents/compile.mjs:19 \u00B7 integrations/compile.mjs:28 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcb5a98d28c1d556015ad1d3208857d58d9ed703b9105d8a1abdc44f57dbfb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): installer/install.js:1519 \u00B7 installer/install.js:1774 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bc3dec61280729cba83562fa230b0fefb0bd45080c36a72c5a50075f01adcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:442 \u00B7 packages/cli/src/index.ts:2524 \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":"packages/cli/src/index.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dac80c86032c42999c86535f29ce2ff818f6296c34d0897d29367d039f7226"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:7536 \u00B7 packages/cli/src/index.ts:7546 \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":"packages/cli/src/index.ts"},"region":{"startLine":7536}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b053a8411afec03852772cd2bdd7eb7ffd48c22ebbea5a7db80d2547884de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:9197 \u00B7 packages/cli/src/index.ts:18795 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9197}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f47e3798aad6c80cddaba9858d6610547ca61bd081302990b9d5dceb044bda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:17865 \u00B7 packages/cli/src/native-hook-fast.ts:385 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17865}}}],"partialFingerprints":{"codehealthFindingId/v1":"186f0837e41ededa2dd37338b7e894ca84d83aefc7c5b5fa79e6b2f7ae9e6df6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:18897 \u00B7 packages/cli/src/index.ts:19215 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e9ba9b9d99f71014676d86a21d9981f3947f3e692d26c5199b1d334890f113"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:21368 \u00B7 packages/cli/src/index.ts:21384 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adccd648fc3812cec3db6d56de48ed906de393e46793752e34a77fcf6a8176f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:21501 \u00B7 packages/cli/src/index.ts:21639 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21501}}}],"partialFingerprints":{"codehealthFindingId/v1":"599716e8f03e9ddac82f29e4cc5cdf7ce600ecfe7905f17698bdca04b09dec72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/index.ts:21520 \u00B7 packages/cli/src/modules/stop.ts:8 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21520}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d683f2c729fa401f5d2e3f3c1de67220120a433bb3f906ba363c268af209eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/middleware/typescript/src/ai-sdk.ts:106 \u00B7 packages/middleware/typescript/src/ai-sdk.ts:118 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b47afdefc7df73b226604d49bb874be7c63071f8cd907223d34973976c330"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): installer/lib/platform-paths.js:25 \u00B7 src/hooks/caveman-activate.js:546 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/platform-paths.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d084013687e520d77a0e17a9c16f003151dce25303dcdebe7ee91cb19f4aa68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/scripts/bundle-pi-extension.mjs:2 \u00B7 packages/cli/scripts/bundle-tui.mjs:1 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/scripts/bundle-pi-extension.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad79c973af59bc8deb76ab8f1942f5cc55b8c992804857f407618e038012976"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:4298 \u00B7 packages/cli/src/native-hook-fast.ts:104 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4298}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7661608d1495dfd3b842432309ee138a06726f7af62bbadd26eed4991f906a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:5932 \u00B7 packages/cli/src/index.ts:19753 \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":"packages/cli/src/index.ts"},"region":{"startLine":5932}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a248f69b16c6df1db2f2c25efe86a616785cbf4f4adf8f7a4b4568bfb69b92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:10508 \u00B7 packages/cli/src/index.ts:10582 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10508}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad037919c21d69eb66ae67db3c86ff0cc58117a1eee775621a53892103dfc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/index.ts:14422 \u00B7 packages/cli/src/index.ts:14452 \u00B7 packages/cli/src/index.ts:14555 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257294b48299c0fd2c0eabf2612db065488b359d4961575b0db9c2fdad4ab17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:14840 \u00B7 packages/cli/src/index.ts:17010 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a93270cf72859fab035a1c65c54a857ce29643a0895aa1e943b15e82d665c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:17072 \u00B7 packages/cli/src/index.ts:18281 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17072}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560b1379200c80cd0cadf9adfe0ffeea525024c71d6f70fcd458dac081bbdbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:17776 \u00B7 packages/cli/src/native-hook-fast.ts:305 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17776}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad43510d1e7be14f7761fff7ff2e11842e9caa614509251081bc07ca139d50d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:17846 \u00B7 packages/cli/src/native-hook-fast.ts:366 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17846}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bcd42d533ec3995511eb8b0a2b28bdedfc4e1424bd693cb30d101449bbcd93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:17875 \u00B7 packages/cli/src/native-hook-fast.ts:394 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faeb7066c9785399542530d6d2c1d64764f7af0b5d6df28a2f061c2112311d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/index.ts:22477 \u00B7 packages/cli/src/index.ts:22503 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22477}}}],"partialFingerprints":{"codehealthFindingId/v1":"77edf82656e45c012f8b9108674f9123ed801bc7c7e11f0d36d8e68f0b7854a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/index.ts:17639 \u00B7 packages/cli/src/native-hook-fast.ts:209 \u00B7 packages/pi-extension/src/lifecycle.ts:147 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00715b4251cf3834ff2b6d2b03ec172a8a0755b12f2e0a6448e266a3af17fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/learn-autopilot.ts:150 \u00B7 packages/cli/src/modules/provider-logins.ts:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"be290197a847921a4b8ef7c61eacec7af031a0fca898b76e3c9f08a46a7497d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/portable-command.ts:63 \u00B7 packages/subagent-tax/lib/process-tree.mjs:55 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/portable-command.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"478afa2925d16d487044b308ca1967e55e0128ff9dfff61884d027639abb8f89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/pi-extension/src/recovery.ts:124 \u00B7 packages/pi-extension/src/recovery.ts:228 \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":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb6b97fbc1eae4b34cb260f2c89301a22d42e01658cb1db641d13850ab50296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/caveman-activate.js:315 \u00B7 src/hooks/caveman-stats.js:625 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9edafe0be6cc10ea44c9f39026a50b33bdb95c2cf2ca36489187a2ce4766774"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/hooks/caveman-activate.js:331 \u00B7 src/hooks/caveman-host-session-start.js:78 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a37abc36c53d5bbe97fffb003eb77622180743055043f87036897714f39d94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): agents/compile.mjs:194 \u00B7 integrations/compile.mjs:37 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ef62a163e427ae40ce74a2e28c21133352db2bff435937e102c353c1e54159"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): engine/pixel/internal/atlasgen/extract-atlas.mjs:11 \u00B7 engine/pixel/internal/atlasgen/gen-golden.mjs:6 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/internal/atlasgen/extract-atlas.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1472eb2147eb9c732cb5fbfa6c2a401cae6f27f192dbcb106d36b69acb284edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:1244 \u00B7 packages/cli/src/index.ts:1604 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b95c544da99cea3df79b5cd432a1d814011be82e14ee1dfc43aedd7acb2b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:2902 \u00B7 packages/shared/binary-installer/installer.mjs:78 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82f0329171f2d027bdbe5efe8f85c446de81ec4eccc5648a11bcf74499ae6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:9002 \u00B7 packages/cli/src/index.ts:9122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9002}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf029939b4fa0e0424d4c6da74809455fb60f5441280eae7ef773c9f322cca8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:12778 \u00B7 packages/cli/src/index.ts:20544 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12778}}}],"partialFingerprints":{"codehealthFindingId/v1":"821cca63929fd4c1b96073a8eb7a0348c1de81046e48e81a5e9eb3f4d0f1f066"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:12848 \u00B7 packages/cli/src/index.ts:20564 \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":"packages/cli/src/index.ts"},"region":{"startLine":12848}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a9b0bc83511c856ba175072e4d502144cda2739fbc7cd76b53cffd299f09fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:14747 \u00B7 packages/cli/src/index.ts:19419 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc0f313db8428cff1c381cbd2c3f56ab3b1af4f7be88172244a15a3eedbe8d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:15070 \u00B7 packages/cli/src/index.ts:16359 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15070}}}],"partialFingerprints":{"codehealthFindingId/v1":"432cd61ebaa140e87aa2af1b85b1c77501237e91474c58df8ec0861775921e28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/cli/src/index.ts:21078 \u00B7 packages/cli/src/index.ts:21098 \u00B7 packages/cli/src/index.ts:21126 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21078}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e22cc37aee69a4e3e5e36650ada4f54b9f9550b9e6cfce72d1839c6b10620e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/index.ts:1463 \u00B7 packages/cli/src/modules/provider-logins.ts:87 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbffc76e7821ee5df8e54412af73947ee90a88b6fccb0d734392f40d32ec7cbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/index.ts:4303 \u00B7 packages/cli/src/modules/apply.ts:122 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4303}}}],"partialFingerprints":{"codehealthFindingId/v1":"be55effa24dab318d4c2ba63379532865725749b071f8527a48636e5b4b26b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/cli/src/index.ts:17653 \u00B7 packages/cli/src/native-hook-fast.ts:186 \u00B7 packages/subagent-tax/lib/sink.mjs:152 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17653}}}],"partialFingerprints":{"codehealthFindingId/v1":"295912915026c61c50c29c4a842bae9d297b797507620ad353e92512ac04d462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/shared/contracts/scripts/validate-continuous-improvement.mjs:98 \u00B7 packages/shared/contracts/scripts/validate-continuous-improvement.mjs:126 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-continuous-improvement.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7dd9606af3418f3e116feac748e2a859bb482253b3e6ef709bc5d47c1dbaa3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/caveman-activate.js:141 \u00B7 src/hooks/caveman-mode-tracker.js:53 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf59ebe3b5877b0b3e573490704c63ed50891cb614dd5ffa51ad9460b5e9bc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/hooks/caveman-config.js:460 \u00B7 src/hooks/caveman-config.js:782 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03e76b711982d06dfeb9e53765c620dcd8f5f0d8cabb38b1706207ad09724c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): agents/compile.mjs:351 \u00B7 agents/compile.mjs:362 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"272509f327b924c32f6478f3f1c6622107ab02b07e13db2142d2d59cab715c20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): agents/compile.mjs:485 \u00B7 agents/compile.mjs:491 \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":"agents/compile.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e3386c9292f1531150dec9e2fcafda86f38ebfae793148d390bfb92cfc37d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): installer/lib/cursor-native.js:75 \u00B7 installer/lib/cursor-native.js:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/cursor-native.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de055b665b7f0bbd80158ae05486031c1b49d9af62f7c1a5e58901cb8c5afca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/cli/src/agent-mcp.ts:486 \u00B7 packages/cli/src/agent-mcp.ts:517 \u00B7 packages/cli/src/agent-mcp.ts:525 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15c880d07d01a16291d279a69e90338feff8c71110cd7571c584d5593eaf941"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:1575 \u00B7 packages/cli/src/index.ts:22790 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643c584aa2ebdc3023fdfeafd41eb9ff9196b3913bf2f9037afc8b0af2214e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:6746 \u00B7 packages/cli/src/index.ts:6775 \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":"packages/cli/src/index.ts"},"region":{"startLine":6746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8868584ec5324423e674499a1111da3bf34b7454147a9a0c969853fc89ac2033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:9119 \u00B7 packages/cli/src/index.ts:9768 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9119}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0be723cbaef01848d789a0fbc0a02897e2605f9503aabe9e78a4a9cf228e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:12268 \u00B7 packages/cli/src/index.ts:12605 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12268}}}],"partialFingerprints":{"codehealthFindingId/v1":"129fb98880aeea349d1a5c6962d01ab82f35fb70cba5d89516f0a9b48552fefc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:14520 \u00B7 packages/cli/src/index.ts:14534 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14520}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e47a357f7dc519301a20bc62bb80f361e91f49da18c1e5dfb66930d08f1fb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:17122 \u00B7 packages/cli/src/index.ts:17198 \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":"packages/cli/src/index.ts"},"region":{"startLine":17122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c35a54ce37860fd9d80c36382df37d5260df296bea8b3decfa47047cae079"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:17467 \u00B7 packages/cli/src/native-hook-fast.ts:131 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efb88f100992a80eec9f42a89b8dbf982db3b00c7ce63fd6278bdac1ab5cc7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:17738 \u00B7 packages/cli/src/native-hook-fast.ts:271 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17738}}}],"partialFingerprints":{"codehealthFindingId/v1":"440dbc6232b76533f83218f864e883f39c28a648ca12c6415f905f3f17d6f649"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:18285 \u00B7 packages/cli/src/index.ts:18412 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e582ae24e5633d1bb09f0761e930d4aeafb75c1a35459e652f85df8da8a97800"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:18539 \u00B7 packages/cli/src/index.ts:19548 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18d7c56293a19eb69cdc797184aa5f1cb3fef8e84cd8caebfd0f66310d6fd35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:22316 \u00B7 packages/cli/src/index.ts:22574 \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":"packages/cli/src/index.ts"},"region":{"startLine":22316}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e8aaa8129cbd83c2ed494881f5bf442495cae0820d5f97248d7c9ef948730"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/index.ts:22668 \u00B7 packages/cli/src/index.ts:22682 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22668}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a453d426a7d5c53a00dc2c5a71fd1221fa7a087b2e157be9edfbb0f7a33ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/index.ts:21533 \u00B7 packages/cli/src/learn-autopilot.ts:150 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21533}}}],"partialFingerprints":{"codehealthFindingId/v1":"445f57835ead67e1fd1560d894592cd137c00d3e0c2abe918bbff4cbdc285996"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/portable-command.ts:7 \u00B7 packages/subagent-tax/lib/process-tree.mjs:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/portable-command.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b465942971cb0726cada83be0d7a6c7db73c348b5525fc489f1f086d34c1c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/middleware/typescript/src/langchain-model.ts:175 \u00B7 packages/middleware/typescript/src/mcp.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82bfc200831e61dfe7cb53f5bfcddb59c37395abb4e17a0a699732a4428d554"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/middleware/typescript/src/mastra.ts:61 \u00B7 packages/middleware/typescript/src/mastra.ts:87 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2874a4d936fdc8cda5bb4b0264313a6eaf7c421f61fe35d42705cdbd78065f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/hooks/caveman-activate.js:187 \u00B7 src/hooks/caveman-mode-tracker.js:82 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"398aac691cb4b44ab1698e75ea2597fab2c6eb0b5d802240f2e66c6d6ee9bfe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/hooks/caveman-config.js:330 \u00B7 src/hooks/caveman-config.js:534 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895d26061ed0cdd181fcb1ac2b4e84a3e6d3fc8b75cbaac1ac60c27ead0fa37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:1390 \u00B7 packages/cli/src/index.ts:5141 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5905d110660b580f599c23b62a829690c2d3df55fe0cdb9d10376b515d3ce248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:14433 \u00B7 packages/cli/src/index.ts:14584 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd77369631422fa585a84a548a4438a1a4d33125269725d9eb7e34fd0702fdfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:14770 \u00B7 packages/cli/src/index.ts:16821 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14770}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbcb22fb31aae5240a1ed6264d072ab9cc66731e44377d5e68978e56fa202fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/cli/src/index.ts:14834 \u00B7 packages/cli/src/index.ts:16984 \u00B7 packages/cli/src/index.ts:17024 \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":"packages/cli/src/index.ts"},"region":{"startLine":14834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c568e9f7b30406461aec89d3265510d96565288c03bbeef82ef8d47bf0567a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:14938 \u00B7 packages/cli/src/index.ts:15226 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14938}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa33c00297f6057798af3acff62dc53270da2bd74a1b9f1d7ac8b62d84dd02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:18511 \u00B7 packages/cli/src/index.ts:19495 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18511}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a4bb3647fe43996402fefcf336e98ab201eb91784a0d002f2f83e7590d4863"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:21034 \u00B7 packages/cli/src/index.ts:21153 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21034}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aca22c594f1286683514dda0d4e5489bbff1c04c08b89ba8d81510c9f85587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/index.ts:21631 \u00B7 packages/cli/src/index.ts:22909 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67dde4c50d4fe8229e04c7776be2ff6584c0f76b5632d4afa795de92b95d283"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/middleware/typescript/src/ai-sdk.ts:139 \u00B7 packages/middleware/typescript/src/mastra.ts:187 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce9ce44672c8d06ccce53ee8e4d4620b50f9ce95843d184785cf98f1e6b700"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/middleware/typescript/src/anthropic.ts:45 \u00B7 packages/middleware/typescript/src/openai.ts:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/anthropic.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c456b421689d7c87ffb4df8aa4c38178405353353e9b5497e561e918e7ca90d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/middleware/typescript/src/langchain-model.ts:141 \u00B7 packages/middleware/typescript/src/strands.ts:86 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3531e4bb0a9d1c149c0aae435907a5621930ccc3daef9bf4d78d6448455a15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/sdk/typescript/src/middleware/runtime.ts:456 \u00B7 packages/sdk/typescript/src/middleware/runtime.ts:503 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef19992438fd73a109ef8f602368e8bc234ffc2a73e17b57062e64887fbb57a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/middleware/typescript/tests/recovery-errors.test.mjs:147 reaches past another workspace package\u0027s public entry into its internals with a relative path (../dist/common.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/tests/recovery-errors.test.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2de1a7a418b813450ffe92a9fbcd83a1b1bd14646820b2d65feb098002ee7d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/pi-extension/src/index.ts:1 reaches into another package with a relative path (../../cli/src/provider-routing.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d215b4259a9220a56054fa0ad14d94cbcf9275a53033d2c8c43eded4428bc8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/pi-extension/src/portable-command.ts:18 reaches into another package with a relative path (../../cli/src/portable-command.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/portable-command.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"215c3e0cf11b20dc53b117b5acecb384c46114feaf57e3c8ba2853d5d65d7d04"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/pi-extension/src/protocol.ts:1 reaches into another package with a relative path (../../cli/src/provider-routing.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/protocol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d583a81199c31c5c30c6d9c43281bc1681509920c533f2ceff1735d105119e09"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/pi-extension/src/provider.ts:7 reaches into another package with a relative path (../../cli/src/provider-routing.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022de913ab3149a6ad0de6b005eb3799e7ad0c4292ffa4c7a23a7e02f8cc3fa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/shared/contracts/scripts/validate-continuous-improvement.mjs:4 imports ajv/dist/2020.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-continuous-improvement.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd37a7de00b02c0a84a26f0a5e895d8a2e4aa4a5bc4c9ee80fb6498d5f9d99"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/shared/contracts/scripts/validate-schemas.mjs:4 imports ajv/dist/2020.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-schemas.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefc000859f4ec7759b312705eab1723b38325ca3cf4a1963e9bc970e446ecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnWrapped (cyclomatic 168, cognitive 200): spawnWrapped has cyclomatic complexity 168 and cognitive complexity 200; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6650}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fff6404d37c7dc5862413e7383fa9211f8816c810b376b035be416128c78b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstall (cyclomatic 161, cognitive 328): uninstall has cyclomatic complexity 161 and cognitive complexity 328; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5bae8df176fa3814e4b6132c0ace4b26cd422eb7b2e0cb8973e88c54030a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreNativeOperation (cyclomatic 130, cognitive 223): restoreNativeOperation has cyclomatic complexity 130 and cognitive complexity 223; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11020}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7fa6e30419f6c54b63800f70e6ce949a2901b26ccae95900a65c87a917477e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeHook (cyclomatic 100, cognitive 94): nativeHook has cyclomatic complexity 100 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18041}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e7f4f3bb7669a22a099ece1279ee8d6c0edb4bb88d15bf69e76119e5b70d68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeIntegrationStatus (cyclomatic 93, cognitive 80): nativeIntegrationStatus has cyclomatic complexity 93 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9c9ca11c06e6278362e8b35ffa6ab367d6a49371ca93d485aaed634cff780f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onboard (cyclomatic 82, cognitive 140): onboard has cyclomatic complexity 82 and cognitive complexity 140; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2252521332f245649231dc572355e178ce4d5aff58f616a311e8327e863ba227"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPlan (cyclomatic 74, cognitive 32): checkPlan has cyclomatic complexity 74 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d56e0e5ae341f7c5129ed88a82a5ee26cab417d6763c079c0a7bd8e40ce1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReceiptContent (cyclomatic 73, cognitive 79): validateReceiptContent has cyclomatic complexity 73 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22068}}}],"partialFingerprints":{"codehealthFindingId/v1":"60902b0a5113968a0d6a51a14edf595644d18bcbe68972d7ad11ebceb26b57ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatForRoutedModel (cyclomatic 73, cognitive 44): compatForRoutedModel has cyclomatic complexity 73 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb9c55c4ab9b26fdb15c1dcf26f12f21d7aa7d0fb5e12baebbb2661c3256a96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function status (cyclomatic 67, cognitive 66): status has cyclomatic complexity 67 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21758}}}],"partialFingerprints":{"codehealthFindingId/v1":"141e1555f95204fd3207d43ac4843b47805957a76d54168398296973099b1dec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenRouteOverride (cyclomatic 66, cognitive 103): qwenRouteOverride has cyclomatic complexity 66 and cognitive complexity 103; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16083}}}],"partialFingerprints":{"codehealthFindingId/v1":"0813acf3bd5c657737677c2e5e677d4f91d91de50c388a6c9bc76c10b12443bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 60, cognitive 76): validate has cyclomatic complexity 60 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"98883009e063918541a02f39320615ec13f8ff6b8bec828198a4390de89594cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 60, cognitive 53): main has cyclomatic complexity 60 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b123478393fae6a61546d19a46883b04026c80fd78668b3169f5f4201079aca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 54, cognitive 74): apply has cyclomatic complexity 54 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cdbab1cf820af1f600ccefd70358e0ffc10938e59427f0bdd329b9243129ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOwnedMcpPendingJournalAt (cyclomatic 54, cognitive 38): readOwnedMcpPendingJournalAt has cyclomatic complexity 54 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16509}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b9aca01c97ed2f0b240900a0791258b6c267ea9b7503d0bcb81060f4f3de5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeDoctor (cyclomatic 53, cognitive 57): nativeDoctor has cyclomatic complexity 53 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50b6b70b27573eca7f1c3bceb7a2ace106bf5eda279d1903f24a6116b7e5bf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 52, cognitive 69): main has cyclomatic complexity 52 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb353c4112fce57dac56df00f153befe2539f1fa5187ec6c600f2ee07893b276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWrapEnv (cyclomatic 51, cognitive 70): buildWrapEnv has cyclomatic complexity 51 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6675579f874c5dddc0112d55027934440d71800f3d54f4bd5e13f5067f52af6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 51, cognitive 67): project has cyclomatic complexity 51 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98d0a0d11d9d294f1d60602d309062aab5911c927bb2e34c3d268036bd3a945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function login (cyclomatic 51, cognitive 47): login has cyclomatic complexity 51 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e84bfd16174c573e1ddf77c7069e8743dfddb21a3361aad15a97d0df7e8010"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 50, cognitive 66): handle has cyclomatic complexity 50 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad3e08d2f33991f6ecd9496d1d0b70e2ccf2ee225161655446902b45f7d7521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installOpencode (cyclomatic 49, cognitive 87): installOpencode has cyclomatic complexity 49 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2803c957d3e60e6440aea5241c2e4113826e67fff05329b1e6147dc4064937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cavemanFetch (cyclomatic 49, cognitive 65): cavemanFetch has cyclomatic complexity 49 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c5c8a28c404f20f61412a44db25177f1580c1515f8914a74ba908679ccd63d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 63): (anonymous) has cyclomatic complexity 49 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e85f46ca9d617e38469ffc1e82960d7c2d77b3208598d3bc3bb4f82922a24b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installHooks (cyclomatic 46, cognitive 59): installHooks has cyclomatic complexity 46 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"145adc2f790e07c33edb433e43beb75d456fda02ddcbb78e3fa41e09181a9865"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installClaude (cyclomatic 45, cognitive 78): installClaude has cyclomatic complexity 45 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8923cbf36da521c84748d1d044b59573e5ede3e50c31b8b41cd070d9ccfca8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 45, cognitive 59): prepare has cyclomatic complexity 45 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2dffdae35b72ec2316103b0f0669ed340c1da99b998f382523d9d3599349bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentShortcut (cyclomatic 45, cognitive 48): agentShortcut has cyclomatic complexity 45 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a9cf9a89efc1aba5771cca39083b52e3da58ab3bb73e172c03c58d6889bf78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 45, cognitive 43): parseArgs has cyclomatic complexity 45 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d923e3a2e00ed63b099c784d3ba08a835f88ba0d542acd18c207ebedb04935"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseModeChange (cyclomatic 44, cognitive 60): parseModeChange has cyclomatic complexity 44 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-parse.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9654ae9b80eac853caad4f6dc5dc123bc744bf1929229937101e910e694bb8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learn (cyclomatic 44, cognitive 59): learn has cyclomatic complexity 44 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20887}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c01b574a1bcd7d0f2c5d81185b13f654099d7a34ec19d63e76d270ef047a9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #optimize (cyclomatic 44, cognitive 49): #optimize has cyclomatic complexity 44 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce42f0059ba7f2b3e54caf0781518cdda072edf77021a7ed532b4c9eab630571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toRow (cyclomatic 42, cognitive 29): toRow has cyclomatic complexity 42 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2a2b252b47fbd405dc48e311e9a4415b4313ac7444335dfbbee46fdc88c79e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 86): (anonymous) has cyclomatic complexity 41 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"75efeb02460377d796f22ac530a0d1be5bda2820f72b566835ff6ac8a326a416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planModules (cyclomatic 41, cognitive 62): planModules has cyclomatic complexity 41 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2faa4768ee96fbff4375b14f444602b9eb9ba697ad49001ee9b611938b57f6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyModules (cyclomatic 41, cognitive 61): applyModules has cyclomatic complexity 41 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ef57e4010debd8a773ac377a192bd6fa02a4f63410dfd42dd8efb007b1ae78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeProfileMutations (cyclomatic 41, cognitive 43): claudeProfileMutations has cyclomatic complexity 41 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8930}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0058b687d59d6feb6d8562c263336f0687e28e211d2661dd0989a3c093514b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toRow (cyclomatic 41, cognitive 37): toRow has cyclomatic complexity 41 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/ingest.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"670650ae5c8f1780e52be38ef358519b6b4afae4a2fad5aeb2c628fb528c2f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kiloRouteOverride (cyclomatic 39, cognitive 65): kiloRouteOverride has cyclomatic complexity 39 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15856}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b332071b5d6a283417e2883c81703cd21e0367ab8084f1f5c80e275e74f06b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSessionSavings (cyclomatic 39, cognitive 39): formatSessionSavings has cyclomatic complexity 39 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba4182d55e3b5fd58958dc988314260206d97910edc5c0d737884333fb06b08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOpenClawOverlay (cyclomatic 38, cognitive 54): buildOpenClawOverlay has cyclomatic complexity 38 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12111}}}],"partialFingerprints":{"codehealthFindingId/v1":"afec584f3be2799073542c96140a4afd0ffd5d51bf89534464887e7f6200899c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeRuntimeRequest (cyclomatic 38, cognitive 33): nativeRuntimeRequest has cyclomatic complexity 38 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6319ad208b28a41c8f23775c1fefbce69941bb436933c0d862c7a56a4577765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mem (cyclomatic 37, cognitive 46): mem has cyclomatic complexity 37 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21062}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab1ddd23e6b51f7aa4f0194167212063be88678d4c4bfd9a061c34554b48b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modulesDoctor (cyclomatic 36, cognitive 59): modulesDoctor has cyclomatic complexity 36 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/doctor.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2946278f661e746a5c260045deebb8bf5ff797173d442fb0d4a7d8ec79710fcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCavemanDeviceFlow (cyclomatic 36, cognitive 54): runCavemanDeviceFlow has cyclomatic complexity 36 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/device-auth/src/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8822ac6f21069ec9a07fa2a1904f1bf2273c9eb45c552507a97c0b4b512f9f1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 36, cognitive 33): constructor has cyclomatic complexity 36 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5947bdc122ff7a0e2e28104d05dd2aae2987ed245b580493752db83aa0e5a2ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function opencodeNativeMutations (cyclomatic 35, cognitive 36): opencodeNativeMutations has cyclomatic complexity 35 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9763}}}],"partialFingerprints":{"codehealthFindingId/v1":"617b53188485c33899e35230a0974343e245dd2a1bed242a301a7b2b4701d867"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 34, cognitive 63): project has cyclomatic complexity 34 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbee17483b030a73a27795c6ecd3a90e9b9d3c2800b67d48457e9413f5e7b4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preserveOpenClawProviderCompat (cyclomatic 34, cognitive 34): preserveOpenClawProviderCompat has cyclomatic complexity 34 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/openclaw-provider-compat.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c706af88dd68344e57cfd9fca1e56189ce5ade016ef0a686b2f55ddfae617141"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localScanUploadFromRetro (cyclomatic 34, cognitive 28): localScanUploadFromRetro has cyclomatic complexity 34 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca27c07d1fc60fbde97712206f7768203a48ae514763aa1a8acd4914dadf338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assemble (cyclomatic 33, cognitive 68): assemble has cyclomatic complexity 33 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd611dd8187c9caffe54b291bfa9139b24071a85a1a55abdff41d63979afce51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 33, cognitive 55): validate has cyclomatic complexity 33 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c843ceb8bf003015b8299a11d39c616a1d9d7390503a10a822da74e9e2bae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contextPack (cyclomatic 32, cognitive 31): contextPack has cyclomatic complexity 32 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30486e133a9a7605b50c563b491961f052a0e4fa4f013141239c7d992475a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanClaudeProfile (cyclomatic 31, cognitive 57): cleanClaudeProfile has cyclomatic complexity 31 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac4af8a937207bb9420c6636a8f84b24db6c80071b054f2d0aa5adefda60da5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 31, cognitive 53): run has cyclomatic complexity 31 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e719d4b5ae0ec4dca1ec775f844797d680e2b7721877d33cef591d908913cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transactOwnedMcpConfig (cyclomatic 31, cognitive 37): transactOwnedMcpConfig has cyclomatic complexity 31 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd952a0cdf498f4728e7c1dbb9540b22ee0fb71002a79ee855293fbfc3bb48be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function managedHookIdentity (cyclomatic 31, cognitive 22): managedHookIdentity has cyclomatic complexity 31 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8058}}}],"partialFingerprints":{"codehealthFindingId/v1":"b320f8295351e8d7bfe253e837c19fe63959c43bde5b15da7a979e7a059ab3a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLearnPlan (cyclomatic 30, cognitive 58): renderLearnPlan has cyclomatic complexity 30 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20289}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c01f3682ae261c75cf524c35c5282f8473a9ca8600dbf0723bf5a4c352a5b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeWriteFlag (cyclomatic 30, cognitive 52): safeWriteFlag has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0840b577ebd810040160560b5be5ea77cc85bc955813ca73de6fa65e0ffe72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureHarness (cyclomatic 30, cognitive 34): measureHarness has cyclomatic complexity 30 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb8a949937ae8b1c9f098560cc8ffdce887f8950ed7ef097fd41d2d4199da0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installOwned (cyclomatic 29, cognitive 47): installOwned has cyclomatic complexity 29 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c46a8979d577bcd4368e908f76faf670a053a977643c2205c76c97b28ca8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installGemini (cyclomatic 29, cognitive 43): installGemini has cyclomatic complexity 29 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"b801223cadbeace295b87ffdc42935606d034d9093c69b1314aca3b9129d04b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inactiveReason (cyclomatic 29, cognitive 41): inactiveReason has cyclomatic complexity 29 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fae059cc60fdd3c7e1acee5621dbac00d250c1828814bcf659f13fe3b9c3409"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTraceFilters (cyclomatic 29, cognitive 36): validateTraceFilters has cyclomatic complexity 29 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"35825513d4d375c58c42ddce03700a297b4b3eb245cd33a76dcce29d8b8f99dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenControlSurfaceOverride (cyclomatic 29, cognitive 34): qwenControlSurfaceOverride has cyclomatic complexity 29 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4aca9b09a5f81995eac7b86a5ecd05d59db795c34ffe465865644dbb006d3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engineSessionTelemetryFields (cyclomatic 29, cognitive 27): engineSessionTelemetryFields has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5584}}}],"partialFingerprints":{"codehealthFindingId/v1":"107787ed96bce9f1c1a6da7523d3317d5b0e7127e887502141c9e446200853dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 29, cognitive 26): project has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ce3964de30c06de0c560f74a0e47b5b8894f786bde5a6da07180e2cddaf93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hooksCmd (cyclomatic 28, cognitive 50): hooksCmd has cyclomatic complexity 28 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64b04ec47cc052a191c979aa9147aeab9cc740d8349468e715cd964f0aa3d32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLearnSavings (cyclomatic 28, cognitive 42): renderLearnSavings has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20604}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e00548f9beb987d9bdda19e58ab2b6f203e9be9178578f2b0d16bdbdbbbd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimize (cyclomatic 28, cognitive 33): optimize has cyclomatic complexity 28 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd383bd81e660a5999000ea267d1bfac6f1193c1bd0e023cdf0785f9925979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withMcpConfigLock (cyclomatic 28, cognitive 24): withMcpConfigLock has cyclomatic complexity 28 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f70d8fb146b6a323fcc76d5ba22fb1622019a5f692bbf5cc80747a3d19e04a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePage (cyclomatic 28, cognitive 20): validatePage has cyclomatic complexity 28 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a93c2a40a16f79e065938c9f368ff9ddd04dbdf8528a0c128ad0cd107f7ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermesRestoreOwnedByValue (cyclomatic 27, cognitive 44): hermesRestoreOwnedByValue has cyclomatic complexity 27 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14573}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff884f5f1cd1dd6f4f4b9e253d5ca3930102dbd95b523f3742c4d075b0fddd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermesFlowSequenceItems (cyclomatic 27, cognitive 44): hermesFlowSequenceItems has cyclomatic complexity 27 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19024}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be7a5b7e89fc9000c528096dbc4d65a41c6618a4dd6d0b344d473877a7ac1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStatus (cyclomatic 27, cognitive 41): renderStatus has cyclomatic complexity 27 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21713}}}],"partialFingerprints":{"codehealthFindingId/v1":"099e34d0e726ee255c2e20bd440caf350a1e5e401c16a4593b1e9e5f47f08a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 27, cognitive 41): main has cyclomatic complexity 27 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"19005cb89152acf62e3c844c569ecc9c24b2a0fc94ac76c2b79347b003665e8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usage (cyclomatic 27, cognitive 37): usage has cyclomatic complexity 27 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee133c84b282ddd7c089d223f3a4db23aea260ec8b047f34ca671716db5de033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstallOwned (cyclomatic 26, cognitive 45): uninstallOwned has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1320ff5e130a468df49fe771ee38cdc235049d4f33729c8a5aad063fdc01c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitShrunk (cyclomatic 26, cognitive 27): emitShrunk has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3f74dc5a6b807ca27a0c1e8c0460580d2586887e8aa13dd759cd02a1047112"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolSearch (cyclomatic 26, cognitive 24): toolSearch has cyclomatic complexity 26 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59915cef373e736077d836188c6a57b98491d6b7d6e578a7c9e5076db3477ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordSpan (cyclomatic 26, cognitive 24): recordSpan has cyclomatic complexity 26 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9b7dce029d05b802d57c9f0a7762736f9053024fc387fa3b82739e2bb055e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 26, cognitive 21): project has cyclomatic complexity 26 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mcp.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"727b6ffd7b411b87ef5fd9ea8763ab0c4c3387f60bb118e912f3b41b512407e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectInjectionModelIds (cyclomatic 25, cognitive 49): collectInjectionModelIds has cyclomatic complexity 25 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec91cd87ea41cb75a878ca60eb9554291e3ef946d2cabe4d6dfb61e25aadf42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlScalarAfterKey (cyclomatic 25, cognitive 42): yamlScalarAfterKey has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14355}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a99853a5baf7159af43add76754014413497ce954f571d67ba70157374feaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSkillBody (cyclomatic 25, cognitive 36): scanSkillBody has cyclomatic complexity 25 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/verbs-gate.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6bba1f5f07f5a9274c9f3a2a6e534ce93fe8e53988fbc32dfcb9cb9e6adf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedProviderRoute (cyclomatic 25, cognitive 29): verifiedProviderRoute has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/provider-routing.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9047c079fa10a863b798e4932e8138f58ada258fcc60c72a3ee8596e3ab54f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 25, cognitive 26): request has cyclomatic complexity 25 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a132ecd0d6af29999bb959ab458b426ffe54a77baf9d79d8746ca6f27b69894d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSurfaces (cyclomatic 25, cognitive 25): loadSurfaces has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/verbs-gate.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9378887d0db44e7d82e10cd9d16b29b75eb844d1f66b538f08848c63d521df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enableNative (cyclomatic 24, cognitive 52): enableNative has cyclomatic complexity 24 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"887cf78241524777d0782ba2fa1e1a32d830869ce0120ad2c9002b94a2f22ae6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermesNativeConfig (cyclomatic 24, cognitive 36): hermesNativeConfig has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb509c951e86d7ea73aeffbcd6f0ffbec303cd4e44851f5636645d5707ccd31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mcpInstall (cyclomatic 24, cognitive 35): mcpInstall has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16778}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c40f755fedba0f00ca4362c548f0d94b2f10f197bbfa2ccb0c0514c46e4c5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeByMode (cyclomatic 24, cognitive 35): attributeByMode has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09bade13a161e2d4fed649fffbf51be11f2f61ff84b3f0cd138badcff00638"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #exchange (cyclomatic 24, cognitive 31): #exchange has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2bc40bf32332a8803f266b7c8c6d6b3b6b1e4f77d33e698dec8f6f1b639e2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setup (cyclomatic 24, cognitive 25): setup has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9fca0059e817363ecc7f84dc58ec12e54634facd22e9f2da70dc63a2866361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 24): main has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cbbd0a58d9daa5587d5e0b3404664de9ce657098550494093515f8566fc361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInvocation (cyclomatic 24, cognitive 24): resolveInvocation has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb04eeac598953088a33714b352e3543355fcfc08cd65e55ad016674bd42af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 24, cognitive 22): report has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92f68dcab33ef49098e79b6bd1e40ceac222fc2b9e48b20e4a59a6a56860fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hookCommandTokens (cyclomatic 23, cognitive 35): hookCommandTokens has cyclomatic complexity 23 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7996}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1c2590c86ef44792cde29429a4e6638cb4b3a8cc3ab857de9247a9cb9805e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatStats (cyclomatic 23, cognitive 31): formatStats has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be8cda4496c7db28a7ad0f3b519dc661bdd0a5f3e7a148c6c3cc972b9377b26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTraceSearch (cyclomatic 23, cognitive 30): validateTraceSearch has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4f158f0df2fc1a2029b342cda5e104a102b3d6c07a5c720e2244bc796283de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatsOptions (cyclomatic 23, cognitive 30): parseStatsOptions has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/stats-cli.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe56b163bd807be90712f1ef57de8ae8db363dabb7594b1af0c740ac2bf6cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeHooksDocument (cyclomatic 23, cognitive 29): nativeHooksDocument has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21d9a62d89046951df1ef7f595b88b70c866048cbe6474e6aecae5e673bb21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlScopedBaseUrl (cyclomatic 23, cognitive 28): yamlScopedBaseUrl has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f76a38505c9b0a4adb9a05f52a8d82b268077102604d8eff5b2b8f38490991"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProxy (cyclomatic 23, cognitive 24): resolveProxy has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"161ed6702a888ad3ffe34edece117b416ccbe67aa0316c70f1b7f69d739efac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptsRecovery (cyclomatic 23, cognitive 18): acceptsRecovery has cyclomatic complexity 23 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/transport.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7a651abd93c40eadd54cddf49e2f52f154e2a267c27b341ccec8e6b949d949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attested (cyclomatic 23, cognitive 11): attested has cyclomatic complexity 23 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646e8e955318a1c7d89c3548ad55bb709ade53d576cc8c19f2d2e7af2fc0dca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermesPluginListContains (cyclomatic 22, cognitive 40): hermesPluginListContains has cyclomatic complexity 22 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19090}}}],"partialFingerprints":{"codehealthFindingId/v1":"95506dab1785edb66b11ea6e23205b2e7b87919a9bb6e4acbf3d6ce70c81adf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSession (cyclomatic 22, cognitive 34): parseSession has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db66e3d8165172a1f26a1b39eb810ceceb615548996f44288984c448dcb508d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installOpenclaw (cyclomatic 22, cognitive 31): installOpenclaw has cyclomatic complexity 22 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0c30dcc1b942aabb93acfa57e85b98540b1d84738f33fe450776db99ecd319"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptsVerify (cyclomatic 22, cognitive 29): receiptsVerify has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22246}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ef091072e767b028958b8506728770826f78069d9466790d31e477a76d8b68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLearnSpendLines (cyclomatic 22, cognitive 28): renderLearnSpendLines has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20252}}}],"partialFingerprints":{"codehealthFindingId/v1":"98783f3d021120bd6a6cf83fe2ec53298cb4c82c4e999ac98074b97415bc8c76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 22, cognitive 24): refresh has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b3c8738d069b42c6715473b8cc05876d11c8a228e1e21ef2ee1af21e72cd08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverPendingAgentNativeBundle (cyclomatic 22, cognitive 23): recoverPendingAgentNativeBundle has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622a0c658c3d629d2caf9471e7d1291ec94eee98986e62ff2776a203e603a4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 22, cognitive 22): evaluate has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95fc044e3693eb4162205fba34772cfa15de7d6bcdfde09f6f5d07bac90fdeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJson5Comments (cyclomatic 21, cognitive 38): stripJson5Comments has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffed658d640c42eb81513615866150303667603f6322acdad01e8346ead32e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmpVersion (cyclomatic 21, cognitive 37): cmpVersion has cyclomatic complexity 21 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/version.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe7f039a063bcb43c13a4abffa1d94ea346d9b72ed18ad2af6615a7dbcfd35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstallOpenclaw (cyclomatic 21, cognitive 35): uninstallOpenclaw has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9842d4e0d1b321195b797416b8c7c82d958721921e6fa730ceaa0239a83cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 34): (anonymous) has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/tests/middleware-v1_1.runtime.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6dd1355f7c2a7a4fb9881444008e0bf25f5c914b036426dbd78ad27bc5b6d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyExtensionRoot (cyclomatic 21, cognitive 32): verifyExtensionRoot has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/verify-extension-stage.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9f6c209dc725ea1e3982d40fd0e8c6d9dd5a30747fd88facb1b4fad0d97215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenWorkspaceTrusted (cyclomatic 21, cognitive 28): qwenWorkspaceTrusted has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15518}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d1db6523784b065dad206c5e3febcc539402681675a7c5221a2263d0e252d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentMcpRequest (cyclomatic 21, cognitive 28): agentMcpRequest has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22707}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112fca39a2ff38a363452079bd36e1c38f20bda0b7df4d96f7248c5aba98c35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflight (cyclomatic 21, cognitive 28): preflight has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a418cbd471e39334e820035950a51e5e045e97c3ccba95be5d7c8ac2243bf4bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexHooksTrusted (cyclomatic 21, cognitive 27): codexHooksTrusted has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10072}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd627d9f0e51878400b7b1d8264fba5a0d2355675b04e7147ed10efe12378233"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 21, cognitive 25): handleMessage has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7f05fdef8b644674a7bd94cfd4aab4d1941e856b2024e8b7e00a6a93d328e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeInspect (cyclomatic 21, cognitive 25): nativeInspect has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17945}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c18ef06f5ef0df79d0105c137d8c6223400362fe9d953fd5b769eb0ec81c959"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moduleSwitchCommand (cyclomatic 21, cognitive 24): moduleSwitchCommand has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca66ee39037dd85d8fc2edf24d5625d5b8bf7f450874a5e6cd1aadeecdd3abf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadJournal (cyclomatic 21, cognitive 23): loadJournal has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5ce3986f73271b4487a0f2dd9bbb4cc99f999071c85d012023debb260259e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderExperimentReport (cyclomatic 21, cognitive 20): renderExperimentReport has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20684}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd83e0abf01da2cc0cf362586ffbf09d89ab49912963acb1cf1fe0ced9ee0082"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function geminiNativeMutations (cyclomatic 21, cognitive 19): geminiNativeMutations has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9099}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea39a60339aca5e403b5ed6221e492b10921af3b7167c9274224d0713042215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processInputStep (cyclomatic 21, cognitive 18): processInputStep has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"425611cb5825a0c0cdb351b1f9be78dc28aa9fd3839e92cc8ba70ae26a971e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardPasses (cyclomatic 21, cognitive 17): guardPasses has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce464e4b6674c870dfdf6bfba5f91bc7954cab82040cab7a2d7afedda607489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCapabilities (cyclomatic 21, cognitive 14): parseCapabilities has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2bd515c334c245bf76baad00cc4a2f34637a2db441110feb67820c855eac8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importSkill (cyclomatic 20, cognitive 28): importSkill has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80eb821f59a06554b99c12a114dfd9265d872fd6062b5baafb7edf810c6e035"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startOptions (cyclomatic 20, cognitive 27): startOptions has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45b7600e47a81a6b445b00c193aeebb622b176c932f4fe342cf3d8b9a9fa00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installSettingsHookGeneric (cyclomatic 20, cognitive 27): installSettingsHookGeneric has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18237}}}],"partialFingerprints":{"codehealthFindingId/v1":"987d84243edf0d9092548f334130fcd9f07e589e98a6f12bc70d6d5d1d73d83a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skills (cyclomatic 20, cognitive 26): skills has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4a37ea6d7c4d9fc11ed8aaa803c32833f4b22cbd3b7a594daf39b7cd75b2b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stats (cyclomatic 20, cognitive 25): stats has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19599}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48e02e7bdd7248049c1b341e3f325b1679c264f6011a9e902a126a0b6cad4e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traceSearchBody (cyclomatic 20, cognitive 22): traceSearchBody has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a135f4a512e5b50d4b326b8c369829d923a677a3b4978f8a89a7b216c177941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plan (cyclomatic 20, cognitive 20): plan has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a224af45e232d6d184277770b525fd047eba24ae2bdfd66dd63ac87f27122e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compress (cyclomatic 20, cognitive 19): compress has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a05aa960c6b2ef3ea517aff48a245f9af1cff0a1c81f2591910dab3150f494f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runExternalSkillAdd (cyclomatic 20, cognitive 18): runExternalSkillAdd has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0d1cb8fa22cac8b426493cad4288e1093ae11959c9cbcffc9fe3981ed2b311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRunState (cyclomatic 20, cognitive 13): readRunState has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92aa07dee0b3fff4e75d96375bfdcfe776e13d0e7671c23e8dc594d5f184fed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformResponse (cyclomatic 19, cognitive 47): transformResponse has cyclomatic complexity 19 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp-servers/caveman-shrink/index.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca7a49985a2170c4deb39b6c6dbe590d1da7093d6aa2637c6dbac141f33189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsonComments (cyclomatic 19, cognitive 36): stripJsonComments has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"62856630dd5d767952c923fe74bd5acf96ef4d98053d644ab4e5c6817a4251b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setupInstallLocked (cyclomatic 19, cognitive 29): setupInstallLocked has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"33504d68d1ae55b16c147655b4e9bcdb52baba80e098efdb33f3786391be3ae6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 23): (anonymous) has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4536fd79c3db7bc17d46ca094efa6196e53bd46f906d0842c3626dba3add92c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claimLearnNudge (cyclomatic 19, cognitive 23): claimLearnNudge has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac3f06c487c8f3cb129a8c27cc01bfc41aa3be594c5f0d065efe27549d0f9c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflightAgentNativeBundleComponents (cyclomatic 19, cognitive 22): preflightAgentNativeBundleComponents has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83cd55487324d5e7729269524c57c0d5f02c0b9955cd98465f56fd00f92550f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/harness/stub-control-api.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d03cb02e51ad452accbf71f397a57b46fcc1daf141321106a54352d36c9846a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addCommandHook (cyclomatic 19, cognitive 21): addCommandHook has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7808c6cf50b13ab0278fe3acc2c947b97016ec1a52fb2014dd6b6db6e4c9f9da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 19, cognitive 21): start has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5043fc3d9e6871cf1f349753adfed1b2b14f59a7786d251ab6568ea4723630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firstRunExperience (cyclomatic 19, cognitive 21): firstRunExperience has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f529240bdae371d3c3872f7da3f86a18bb41937cf5ac27381429df1ab4cb96b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAutopilot (cyclomatic 19, cognitive 20): runAutopilot has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae82f5c2a6ad86e4549a61b0bde91f1e73694e49acc9385f13954d18995406f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeExperiment (cyclomatic 19, cognitive 20): normalizeExperiment has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b160508cad4a864911ad9eed46cc14b62a2727e2b9aa89d45ca3a5a6adfd500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 20): main has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce2ef97c41232a66e3580185617c477f1df329d2e09cde0b60e57ae0f1116ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trial (cyclomatic 19, cognitive 19): trial has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19732}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe47d10e745f692e2b3fcb254b1170a74f24a7199803b50989cb5c339f93103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shrinkToolResult (cyclomatic 19, cognitive 19): shrinkToolResult has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/tool-output.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7637717f3760a29cef6d292102e30610263cfaa55fdb2b74abaece7948ac70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverOwnedMcpTransaction (cyclomatic 19, cognitive 17): recoverOwnedMcpTransaction has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5029d002599bce1bcf67c14c02b0ba608891f604ff0f014795b1c776f8ce6ef8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function privateVerificationURL (cyclomatic 19, cognitive 10): privateVerificationURL has cyclomatic complexity 19 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12828}}}],"partialFingerprints":{"codehealthFindingId/v1":"26460d366230ac424ed135ce1f8ec9012e86707c5b12f075a092e9d192441987"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learnSummaryMoves (cyclomatic 18, cognitive 38): learnSummaryMoves has cyclomatic complexity 18 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20101}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d6839a959ab503cc210244dcd2c2d3234f03f4039d0ad978f8fa78532cbc93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenArgsPermitRecovery (cyclomatic 18, cognitive 31): qwenArgsPermitRecovery has cyclomatic complexity 18 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd2c90c1160bcb30057a8e0c6552f1ecfcd9ccdfeed4ea8e8888de4e932d1b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectOmpRegistration (cyclomatic 18, cognitive 26): inspectOmpRegistration has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a718296ac9e8a9434b2d3f992eae14b17a733dd7c7339d4dc983ec8e9f561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installNativeVoiceSkills (cyclomatic 18, cognitive 23): installNativeVoiceSkills has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10803}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b6000b0ed4842ee1b8d34a2daaae8ba0bdb455e5b68bdbbe0969e3949f9804"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncLocalSavings (cyclomatic 18, cognitive 22): syncLocalSavings has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13525}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e63cf1f64577eb4510618ff57deada88ab4acfa8ae04efcbf885cffa89a701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foundRows (cyclomatic 18, cognitive 22): foundRows has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eb6232bc6e0425d9b65b8687511782db718312caee527d6ddfc9f96a125b5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyBundle (cyclomatic 18, cognitive 22): verifyBundle has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2753a6ae5ec57fc201bd2717b21b263338ca3d302e05f5c9adcc3f32e8215181"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remember (cyclomatic 18, cognitive 21): remember has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/mastra.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ba94c67bf0d0e07fdc995dc18479e1b00219a514fba7328c4c8ce25fe13f72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRemoveMcpKiloJson (cyclomatic 18, cognitive 20): planRemoveMcpKiloJson has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea84f1b2c21463370e18dea6ca7c5781ffb8a0cd0ca2d5a4355fef95390e445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRemoveMcpQwenJson (cyclomatic 18, cognitive 20): planRemoveMcpQwenJson has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3a2cef348f9bb68b94834c850b48c42400183b0d8dd4b380d0721a2c1bcfb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telemetryTokenDelta (cyclomatic 18, cognitive 16): telemetryTokenDelta has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faf64a7d66e25c1df3be752a85796755ce20e8061d2904ffd06d2ac202d9868"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localGatewayEndpoint (cyclomatic 18, cognitive 15): localGatewayEndpoint has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b06ca6d72761d43f2710fdf025dc4690271df96826c7fc05ce804e7ce0eff27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 18, cognitive 15): finish has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-response.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eed1d6e6618ca4e6936427008a3cfdf6150603ef610020ed36d3198719b7b9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMcpServerMarkerBytes (cyclomatic 18, cognitive 14): parseMcpServerMarkerBytes has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4965df0d25c388acfbb2216319482afa540c1492bedb1c8f3f189c5ec6c4ea58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCommandArgs (cyclomatic 17, cognitive 32): parseCommandArgs has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/command-args.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6f399b37f7eac93c98f83fbb543a83b3af333d827ceaeebbe87d90333a5538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreNativeJournalFiles (cyclomatic 17, cognitive 31): restoreNativeJournalFiles has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11442}}}],"partialFingerprints":{"codehealthFindingId/v1":"269a7d1585dcae0d7b41458ebdf61eef01be83f34c85d86ca168be644db2eade"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenSettingsPermitRecovery (cyclomatic 17, cognitive 23): qwenSettingsPermitRecovery has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad66f0694a930272a8b01502ae21655688c9a7f5a04524b81e35b30bc2a40ec7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneOrphanedManagedHooks (cyclomatic 17, cognitive 22): pruneOrphanedManagedHooks has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"226407de325624820225669410d9d2f4080fc55557da68fea3d56145943e2e16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownedMcpRegistration (cyclomatic 17, cognitive 22): ownedMcpRegistration has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff59283649d0c1633bf6dc4d1adf64411b5353a9a08f2ae81b72c931906c6147"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRetroReveal (cyclomatic 17, cognitive 21): renderRetroReveal has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6095}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dfb7fe6718abfffb848e6f3922ddbb7f81662b067ff03f310dd1e7fa3b6501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLoginArgs (cyclomatic 17, cognitive 20): validateLoginArgs has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec3d0ce73d1ae0877b29438465c78b6f761d9e0ddc6ed5bdb6b3c0455c4abb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capabilityInputValue (cyclomatic 17, cognitive 18): capabilityInputValue has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a599b833a7cf7ea54eb261aa8d852806b5dc90595b31b8501bb6aa063eb5a3f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planMcpKiloJson (cyclomatic 17, cognitive 18): planMcpKiloJson has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15070}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083ea063991d6bfd8b97d02f3975d312f42c0a39d79f3c21743bb3b5cde2e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"291695aa293a3ce8808d5a393f179ddd48aeb3df9de7b2dcf6f5f3e7937e0237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function embeddedReceiptKeys (cyclomatic 17, cognitive 16): embeddedReceiptKeys has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7b7c413d2792d0b97b8e10511e9acf584bb045d8fd2863757e64a607ff4d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsNodeShim (cyclomatic 17, cognitive 15): resolveWindowsNodeShim has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1894a65a03619ed876d323561500e8efda7bb6b738fbe1de64d226cd68191042"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsNodeShim (cyclomatic 17, cognitive 15): resolveWindowsNodeShim has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/portable-process.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0ee91b59ac1f4be167ebbc0461f09863d0b53778008db404edcc1c7ea884c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsNodeShim (cyclomatic 17, cognitive 15): resolveWindowsNodeShim has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/portable-command.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd649b20f4d0dbaeb8e718ba77fc24b3a74d285bbf651155c4632d8731883c11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 15): (anonymous) has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"51606afca375836222c3d022f1816b2e5fd80a12fe530942a6ff9c898b4ded22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformParams (cyclomatic 17, cognitive 14): transformParams has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4573f43e9e2e317fb79553420b8ec4f9d132118f4124ed3ca5601e8ef315d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validNativeRuntimeResponse (cyclomatic 17, cognitive 13): validNativeRuntimeResponse has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186dc9eb4208baecd5fe32e58ec9e457a98f614a4c5418238717f358b1258a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validResponse (cyclomatic 17, cognitive 13): validResponse has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff5d5bfb036aa4e97a93ce48c132e5ac6cbc7b894106ef3f796d30eca82b28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendFlag (cyclomatic 16, cognitive 30): appendFlag has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9129522e462eec12a5d46925c82ed9382aad77531a7e32e8d25b20e37bf24de5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteLegacyManagedHookCommands (cyclomatic 16, cognitive 28): rewriteLegacyManagedHookCommands has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ec2199272b63fc9f8df9aca4ce8dd8511dbfbe98ff0031b33995a4fd5e743f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStatsSummary (cyclomatic 16, cognitive 28): renderStatsSummary has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/stats-cli.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f269f31d3241ca8670ba6f8989436cae7fcb2e78d3d896feb1389dd97a58bf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 16, cognitive 27): walk has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/wire.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f26c577fd96540a8dcc6fd0265f5e06fb6edc8b8197a862110cf792bbe69c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withIntegrationLock (cyclomatic 16, cognitive 25): withIntegrationLock has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bdbaeaae0142cc704264da62613e85d1f6df31f2216ea75b4506fead956d96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 24): (anonymous) has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2d3cb41094943b74b1a6cc9c1c5a6f3ff50d75a83ad14c47034b0d3ce960d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectUsage (cyclomatic 16, cognitive 23): collectUsage has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0234c78bc2a125ce8bc21a31a56f8ab948db763f4586647ab198df17fb221b6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConfigFileInjection (cyclomatic 16, cognitive 23): applyConfigFileInjection has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f632d1c4f69959a1ece13d27c38780346ca56aa6b79ea7dd6cb4d1050e68811c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function frameworkGate (cyclomatic 16, cognitive 23): frameworkGate has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/compatibility.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2965a0a1672ed40b2e49ecfc80344661f8332936c41a5cfdddcf5e5d91fd5f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acknowledge (cyclomatic 16, cognitive 21): acknowledge has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/device-auth/src/index.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d89e849d2b9864ca2e6fc7271750b1a2c0b71e93cc0df4a0a474efcccfb043"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isValidPolicyDoc (cyclomatic 16, cognitive 19): isValidPolicyDoc has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a44149426fb42fd687089099f3641aa03b5ea2bb477b711a6bfd29e0606a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5900b7af98a249cedbbcdbabb97ee9d8b8da18773063bbd7538e2709cc06d95f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeHookResponse (cyclomatic 16, cognitive 18): sanitizeHookResponse has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/protocol.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a201e2267891a3eff00155797c2498c78c5c10f7425cbcb875dcfd4873b84b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skillsRoot (cyclomatic 16, cognitive 17): skillsRoot has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/provider-skills.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c587b32860671dc168253de076ff38fff628a8981bff35895580cc740f80c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planMcpQwenJson (cyclomatic 16, cognitive 17): planMcpQwenJson has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16359}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cf0d31e533623dd939e6ea810750cd03d6dd7ccc3090b7db4034d9ca0f63dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 16, cognitive 17): parseArgs has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff89a697396d4412dd5380ca3687fed39e159e11d315fc4d24dce695f291ab51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validEngineSession (cyclomatic 16, cognitive 15): validEngineSession has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/ingest.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b800cf67a8eac24845c3d22acba6d7e34f548813fa10235289d8852afef8b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLearnApply (cyclomatic 16, cognitive 14): renderLearnApply has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc8cdbbad48f156b790c08ed5de02f6206fce4f3a84772c74cd78216b8d4c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function config (cyclomatic 16, cognitive 14): config has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22835}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89cd410d4a268a1ef39f3dad1dbaafb4ba7aad66b7d8e3be01bd62eb6a603b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapModelCall (cyclomatic 16, cognitive 12): wrapModelCall has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236914ac01c8a5f75319d5a5d6f01befb1fd76301425e63bd9766b89e8e75af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeCapture (cyclomatic 16, cognitive 11): analyzeCapture has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/analyze.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f9c2a524094f4740f18f8f498b0f953b51b0dd5599d6c7166007cbc9b2e54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hooksDirectiveCmd (cyclomatic 15, cognitive 31): hooksDirectiveCmd has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63aa294fea533e59a8977963c25987e1238a47be3dda94e316d8122c1a351ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlChildSpan (cyclomatic 15, cognitive 29): yamlChildSpan has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92a00ac690b34e1ca2589a3eedab8904673453d524dc778eb4d72d3df0e8dcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function logout (cyclomatic 15, cognitive 28): logout has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12979}}}],"partialFingerprints":{"codehealthFindingId/v1":"5810dc1c28b64e85e88b7988abdc75a4cb918f3b89f25cbcc21b28049a64ba07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enableHermesPluginInConfig (cyclomatic 15, cognitive 25): enableHermesPluginInConfig has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d520641e6ad26f629da0786ed91dc8c481f6c0c398c3c5ea7519c524a07cc8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function externalRuns (cyclomatic 15, cognitive 25): externalRuns has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadc411c7a374a16275bd3ec0c9559532e0add7758d10c7ad545733c7f683b10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installMcpCodexToml (cyclomatic 15, cognitive 22): installMcpCodexToml has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16963}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e81e489b8609dd93a2ad80642e7d7be52571081e627461f9fffdcb9fe6909c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 15, cognitive 21): handle has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4546b43ae610cd58452e4266c9e9550fd4363dd0d3ddd706ee1be55ccbabc977"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOnboardArgs (cyclomatic 15, cognitive 21): parseOnboardArgs has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28044a373fb87e2a9e091ef4b511d51b68712bc2a76237feb860b551f95ee77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendBootstrapToSoul (cyclomatic 15, cognitive 20): appendBootstrapToSoul has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f88f43b0d6f5efb96705b76a5673fa4dc225af5d319bd305fc7d313663f8f68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiderNativeConfig (cyclomatic 15, cognitive 20): aiderNativeConfig has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9863}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c5d650959bfe63ecdc7b39939dc02d516e1a7df67c33e4e632f320bdd99a99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeNativeHookEntries (cyclomatic 15, cognitive 20): removeNativeHookEntries has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10974}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e7461c292381811145f7d547272847e36ef860b6cce6576a73e603cdff466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkConformancePins (cyclomatic 15, cognitive 17): checkConformancePins has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"324c49f80bd820c1b0a61d65a8c03a751cbdd1ef36b70dac69846a2084826008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenEffectiveEnvValue (cyclomatic 15, cognitive 17): qwenEffectiveEnvValue has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15694}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a36661b87d379849e8d40c14ba86d947feae12ea23be26f8b355ab096e79b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLocalScanState (cyclomatic 15, cognitive 14): readLocalScanState has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13252}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1f78edbf6449877768f6092887913e96eb0972ad689c56935dfa47d407fa1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncLocalPracticeFindings (cyclomatic 15, cognitive 14): syncLocalPracticeFindings has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ee0d239d10ac46bc3244c74657abc1ac8ec2959bd08f551dced2664f45f7a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEndpoint (cyclomatic 15, cognitive 14): resolveEndpoint has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39a794af538150dcffbd1bde8352cca548ed7089322cc0196b05d7594068747"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeWarnGeminiHeadlessAuth (cyclomatic 15, cognitive 13): maybeWarnGeminiHeadlessAuth has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7068}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8e262769c6755999ce048bbeae73a68c44ae1c78de633e7775457e323541f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disableNative (cyclomatic 15, cognitive 13): disableNative has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11565}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8e469949e14517daa504bf249778db47b761525791f549d000cfbf32f098d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeTaskTerms (cyclomatic 15, cognitive 12): nativeTaskTerms has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d240f2e24165d7fd3423c143708acea8d8254099de7b519f627ed60963faf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskTerms (cyclomatic 15, cognitive 12): taskTerms has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbff50ec625426ffc741cff6ba0e76f9d6dcbb1071642c626ff3be3e87d5d11f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncPendingLocalScan (cyclomatic 15, cognitive 11): syncPendingLocalScan has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b045c29eedd33aa16aeaae7a522d6701aed242ab91329332f56e5694691cf5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeydown (cyclomatic 15, cognitive 9): onKeydown has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2573028feda73f3824cc77a47a8753c670b814a7cae879e76f740382ad6d842"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripTrailingCommas (cyclomatic 14, cognitive 27): stripTrailingCommas has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"427a2f13095a8520e4af17305703d4c9b866c4a6588e1eae008cf30b4e1c478d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tailObject (cyclomatic 14, cognitive 26): tailObject has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-response.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8ff655024adbd736979ece4be225bd80caedfa316898d45cb527455dbf1085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWrapArgs (cyclomatic 14, cognitive 25): parseWrapArgs has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1e4ed9cbafe935000a6f89acb95485c42281b10959244df1575476379d7eca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memHook (cyclomatic 14, cognitive 24): memHook has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbcaeb65ecd2194cac596a3c8397aa62528343ccde6b2c880e64c2f9ec294e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 23): (anonymous) has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/probe-native-codex-recovery.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef36e315e1d9941169c70b1467d06d8adf03f0ef5b8beba368abc695b759eb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capabilityConfigCommand (cyclomatic 14, cognitive 22): capabilityConfigCommand has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e704958e115447ca1bbf4be0c382b7381bd3d56d7bda1f8af0595d143c92ceee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function experimental.chat.system.transform (cyclomatic 14, cognitive 22): experimental.chat.system.transform has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5062d89e8d51a30e602c39c65fc29af2e861a12833b031fd33de26b88cbcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearAutoModelChoice (cyclomatic 14, cognitive 21): clearAutoModelChoice has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dd7700106f46d7de877e11d4fb7a6518d5b9601cb6953ce5f51bdee7e5f79e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkProfileScope (cyclomatic 14, cognitive 20): checkProfileScope has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/check-profile-scope.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e49e25ce8c4ea12d20fedd9ffc8688c77ef8cdb06663229f0fb3dff0880500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenMigratePolicySettings (cyclomatic 14, cognitive 20): qwenMigratePolicySettings has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a4ca604ab0b2b4c137a294955b80883e05eaf324d057271b580670fa1255f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/langchain-model.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d523200eadbd728755cc4be97571c0bee6aea871cb108fb120fa235f7b7b95c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditEvalImport (cyclomatic 14, cognitive 17): auditEvalImport has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21938}}}],"partialFingerprints":{"codehealthFindingId/v1":"be059760e9c1eb55df7fe1a4e47f4dbfcfd8e771c2cf51cf27e25f23a7a9f7eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLearnTui (cyclomatic 14, cognitive 17): renderLearnTui has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-tui.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeb3a22d0b10d5ae37c51b86df631c350079e1e0cd99058e5e4392a485b7859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee794e96d226b50d8339b79f896d1daa53f609a01c77952c89a228c405314a8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unforwardedProviderHeaders (cyclomatic 14, cognitive 17): unforwardedProviderHeaders has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/provider-routing.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"52407a646563314af2fd0809fdf09e5d97a52f1289d1d9304c8962dcef4ee521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfigStrings (cyclomatic 14, cognitive 16): validateConfigStrings has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6196ae4ecd548e911069a0eeae1773af81314177d06b7c3c974dcbb0412fac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePixelRenderReport (cyclomatic 14, cognitive 16): parsePixelRenderReport has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bc9df0ed7e90e82833ee7ab3fe886d1f0b8684d77387e89e6dd2e7ef02418b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepRows (cyclomatic 14, cognitive 16): stepRows has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d4a13bf0f608eba2c5b31dd594fd90a46fcd383292ed2f8342a35954d23d01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tools (cyclomatic 14, cognitive 16): tools has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6dbd97c6ad98178da5c39640eea0114b6254b53f6f521efc9d1bfa616c382c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAndMaybeApply (cyclomatic 14, cognitive 15): renderAndMaybeApply has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"48faed10ed37df49465b2fca86a0232a012a7c9da38fc69ee5dac80c0d1a87f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function billingCharges (cyclomatic 14, cognitive 15): billingCharges has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9859e3dfe48992739f4a5d01de44bbdb0c1a1aaab5feadfd998648c63fecfde7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/openclaw-provider-compat.runtime.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"270fe58aaf88ab3e81d4e6d1f1dd341fd2249cb1a7e841f378ea19860734f2a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateHistory (cyclomatic 14, cognitive 15): aggregateHistory has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1743be7c66443f877ba2b667cdf223f5eb4a4c45453070d639f8e62389506a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverPendingAgentNativeRemoval (cyclomatic 14, cognitive 14): recoverPendingAgentNativeRemoval has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"884e62b2aadd6872b0fe3ade3b3a04240064a2a192eac73af3d7473c73d741f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHooksJson (cyclomatic 14, cognitive 13): readHooksJson has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/cursor-native.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"699c793c3dc9e8a56dfd507654553a9e3e7de6e0fc0f97948564f0e79cb9ae0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeNativeHost (cyclomatic 14, cognitive 13): probeNativeHost has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd9bdc394e45e5bf798c6f99ada183f3d0ceba83bc8c0a1577eb7a6dc1a07bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFailure (cyclomatic 14, cognitive 13): classifyFailure has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"543704666b3f3e112d7ac3f69acadd6e63684583d56df65eaa7858c43a803a80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestReferences (cyclomatic 14, cognitive 12): manifestReferences has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/verify-extension-stage.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7c7df2e185679e543501e189149dfff620dd86d415da16b5532cae456617f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeMcpRegistration (cyclomatic 14, cognitive 12): claudeMcpRegistration has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3d115c8c70508a3192f3f3ade999f000f75def3b100a7c014a54a7a8afd2c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validCatalogVersion (cyclomatic 14, cognitive 11): validCatalogVersion has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0caa8ad9b7684e23339d27c783228d7af2827a434c755be2a5a558c6c83991"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptsRecovery (cyclomatic 14, cognitive 11): acceptsRecovery has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0bab5ff89503bc475cb343902f161f785025f26dd9fac2eb36ae032e023a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 14, cognitive 11): verify has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b26c9c0b05d17a06b0a3cf045c0b37a7fa450a51a5dd6124f4368e81df869e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeStoredLocalScanPayload (cyclomatic 14, cognitive 9): normalizeStoredLocalScanPayload has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13e46b5594a0c32119a924fdf199edb83a19c8dc2191872ac92dddbc023b40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeDeleteFlag (cyclomatic 13, cognitive 28): safeDeleteFlag has cyclomatic complexity 13 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d97b6a2d15ab16b83a2c8afd155a86019e0f9d8dfeb31e132d16fef78b7d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeYamlDoubleQuoted (cyclomatic 13, cognitive 23): decodeYamlDoubleQuoted has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9871047942e3f7cd5792cd00a7d29e36558f7adf0551f0bfb711210053780e1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOverrides (cyclomatic 13, cognitive 23): applyOverrides has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2573adc515f9425f8d0eeaf312a715224701153552c996584ab3953eda4b6a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installViaSkills (cyclomatic 13, cognitive 21): installViaSkills has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e166ae0f8628084dcbba98ba5828b0a24fe99b0078a561a40a73f68b1dd6cad7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routedAiderArgs (cyclomatic 13, cognitive 21): routedAiderArgs has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef0facda07715a933840e31f291a909db0c631b2ef0c1e8a8d01eb54ef5c78c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsCommand (cyclomatic 13, cognitive 20): resolveWindowsCommand has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27a0671e41999cdb649f36f0d5bb4f9dceb0a56e5517afa81f861546dd43c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsCommand (cyclomatic 13, cognitive 20): resolveWindowsCommand has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/portable-command.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c1e061c127c03140643fb17b8478e86c3fa909a39732183788ffc71032b9f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderModuleGrid (cyclomatic 13, cognitive 19): renderModuleGrid has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/status.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e63469b73b919327e0b9aaf1626fdc48043d3799413ed62b33ab8c3ea2e569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRecentSession (cyclomatic 13, cognitive 19): findRecentSession has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b328c255b8319e3bd222f912deda84f05070ccddbb7922a6d8f6a8916e7c8ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function httpProbe (cyclomatic 13, cognitive 19): httpProbe has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/middleware-e2e/perf.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c5b295a1fbfd717c60f3a808fe7f463741f54688de61bb49ec4fa53b5c26e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformOpencodeAgentFrontmatter (cyclomatic 13, cognitive 18): transformOpencodeAgentFrontmatter has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/opencode-agent.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6113a3894a1c292ddee2eb4ca0687abbba1e46d6f14584cde292bb8b27c0252"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLearnDiff (cyclomatic 13, cognitive 18): readLearnDiff has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20412}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a9bd4e8af82da2180a93287aea41d5d10702763a59644d66ec0702f453379f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeAgentNativeBundle (cyclomatic 13, cognitive 17): removeAgentNativeBundle has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad49652eb22d066be91441fe1c523db57f5b975c81cb6333f7e233f24c41cd8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatedInvocation (cyclomatic 13, cognitive 17): generatedInvocation has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f079d4184a0aa8eed9c7f2f85db2ea8656c837f82cbf1a1b3cc968706d469256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRuntimePolicyResponseText (cyclomatic 13, cognitive 17): readRuntimePolicyResponseText has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"41afcad0c78866d29a31a79372c76227ee863c5038650a01b17d4a51900a8eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverSkillTargets (cyclomatic 13, cognitive 16): discoverSkillTargets has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"072922df19bb5c2ad819dd57de768fa77f1695bf625e36f6e7c7d9e073e4862f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installMcpJson (cyclomatic 13, cognitive 16): installMcpJson has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17038}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ab56b1970fb0c924de6a25684ef342f3ed9815efe41850e7d38eaa9ac60354"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signInStep (cyclomatic 13, cognitive 16): signInStep has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044ef70b0f2fa92d94047fc8318afad332890bb4c49b5125917491770595d78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gcSessionStore (cyclomatic 13, cognitive 16): gcSessionStore has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb9c0afb3cc73a471d76dcb2c7344530171d1e073306d3ccc51cdcdb01cf59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chat.message (cyclomatic 13, cognitive 16): chat.message has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2bff5ecc8e06955fe7fa5efb13b850009cfabf65a1d5135e7ad6ca3c61bd29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnLocalProxyProcess (cyclomatic 13, cognitive 15): spawnLocalProxyProcess has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede4e9e26d847352fc39222ad6267a5a5bf1c943b03fa0dc14914582580ea7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDeep (cyclomatic 13, cognitive 15): renderDeep has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cd0ada0c0a3a29ef4f19ea8d409b142eb880732fa8ee4404c81e061d6ef07c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpreservedAttributionHeaders (cyclomatic 13, cognitive 15): unpreservedAttributionHeaders has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d090a5cc010f6a1551113c601605420e3dcce74a5a31a5bfc6403de68c69a9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapMcpRecoveryAvailable (cyclomatic 13, cognitive 14): wrapMcpRecoveryAvailable has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14041}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d394f10da693236e6eb99572f8ae522a2913e90e3361b8a0bbf3d106adc1c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeMcpJson (cyclomatic 13, cognitive 14): removeMcpJson has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14850}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68488e7c8a185022b711d0fcdad282c140e306c443f2224f22a9190a2d83b02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qwenCavemanToolDenied (cyclomatic 13, cognitive 14): qwenCavemanToolDenied has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15437}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cb1e15e6fc5c2e3616fc05ad08a2fb6cd8ae411b38805704bc6fe2a6ec6c71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newerBundledCli (cyclomatic 13, cognitive 13): newerBundledCli has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47ce09fb07a3da8bd27874ecdda4806173eca7da2991c344c5823ba43012323"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openClawMirroredModel (cyclomatic 13, cognitive 13): openClawMirroredModel has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11937}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce733eb4964f787495dccd8e12269ff2c58076e678ea543bc7d3363da55e07c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telemetryState (cyclomatic 13, cognitive 12): telemetryState has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4684db1c81493e71ba99cbb0c4566ab7483f69b20940ea2bb69275606d349dbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWrapEntitlement (cyclomatic 13, cognitive 12): parseWrapEntitlement has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5143}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8675daa9c49b9814701249c8ca42d1977289e7a685d183a3770d96ec17bf15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncRequestSpan (cyclomatic 13, cognitive 12): syncRequestSpan has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0f0378aaea93ae5a6047500af138643d92ca980cdab133952cb006b895156c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLearnTuiModel (cyclomatic 13, cognitive 12): buildLearnTuiModel has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20206}}}],"partialFingerprints":{"codehealthFindingId/v1":"90707c281c28c8c1ca0a63035babef592783e48a6dcfbfb1bf0cd80f8a16c59f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRawProxyRunState (cyclomatic 13, cognitive 12): readRawProxyRunState has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21486}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d806e7ad8c083d54648f08edb5dee2d7529950830a889bb4f32f14e43d5922"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProxyRuntimeState (cyclomatic 13, cognitive 12): readProxyRuntimeState has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21618}}}],"partialFingerprints":{"codehealthFindingId/v1":"213e6eb66620c600c31aeb12edca759d23bac2705a6f44b35e5ded68ded095c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autopilotStatusText (cyclomatic 13, cognitive 12): autopilotStatusText has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c823a7ef8a1a907e722634cda6928504e0cf25054a934e9c362f4b76373b786"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonable (cyclomatic 13, cognitive 12): jsonable has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/common.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b43323fac39d864c6f2311583a1c0beeb12e569caeb9b9e612f2512ded61c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retrieve (cyclomatic 13, cognitive 12): retrieve has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a6ff624322df509ab37148ef7f056298d11858848214e3fde19d5b7cc3ab70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callTool (cyclomatic 13, cognitive 11): callTool has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceb1128a9ed3e2addbc65e9be043506642cbcdbed1d8cb2501ee31246bb355b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kiloProfileModelIds (cyclomatic 13, cognitive 11): kiloProfileModelIds has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15758}}}],"partialFingerprints":{"codehealthFindingId/v1":"515ed25f4f895b6e9be06363cf678266b6b47d45b0d6b37d801be230387a67b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onData (cyclomatic 13, cognitive 11): onData has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621424f1a3ca2543a538e76c03fa919db58a586866fc62e31a1da19b9e7ebec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f859487e31480c52418120cebbae2a5c53e1f607b4c5960ac06ea771c9054d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4de701213ddc2dd9a79604edc302edbd2beee63cfd8c6b6df722a689fb72e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 13, cognitive 10): prepare has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/google.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe1c5f2e0d519e9db26d5bff6ab269acbc6e59d133e3b3a8ec5ef888bf43554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireClaimLock (cyclomatic 12, cognitive 22): acquireClaimLock has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b6492ac4dce0e2147b4196527ef0553fe2e59aa8ddcd17fbd4829b79b06418"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripTrailingCommas (cyclomatic 12, cognitive 20): stripTrailingCommas has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7389}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc4c7807b67c60b6adcc92569aa86cc8228290cae66bd5a15e80ac6d54bd7a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsCommand (cyclomatic 12, cognitive 19): resolveWindowsCommand has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/portable-process.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dc7b0420b75d86ba0285a2bbe572774033e01f929e140bfbae5f7cf6cf63eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCapabilities (cyclomatic 12, cognitive 19): resolveCapabilities has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c1218c6130d7cbe03362d20bd91946a0fd692a4658a52f9ee507d48941cb9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function managedHookTargetsExist (cyclomatic 12, cognitive 19): managedHookTargetsExist has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccebd9d84981a31522784014d37c4122c88db7775a101f6980d3394f2ce3476"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlMappingChildren (cyclomatic 12, cognitive 18): yamlMappingChildren has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14422}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c121e63ca6ba09ff19f59f04474d82b8666004a24c89112836c28370a01a4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shrink (cyclomatic 12, cognitive 17): shrink has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc10e166e12ea72fd8fda50dec5310c49737347129137198f5085eb232ba554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learnTrendTable (cyclomatic 12, cognitive 16): learnTrendTable has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-trends.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"34352ac3fb24b56b6103225644fac5bdf2250b644378c26ee7079b833848f9f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routingStep (cyclomatic 12, cognitive 16): routingStep has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"91529d86b7d2d2ee5aa845ec6feef1b5294136aa8fee737a7dd611932eaffffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 12, cognitive 16): parseArgs has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-release-binaries.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4db3813b291aab8d89e76ee77f1ba69182f254ce1e9660a25f5244e22420cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activate (cyclomatic 12, cognitive 16): activate has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce686d79b26f1de23b58d65fb1538648fe135048f88dbee02e497898df308f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browse (cyclomatic 12, cognitive 15): browse has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0a1f1ba8b1110b3b931278fe969d89ed201b39337ece34aab8c46a498eccca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProxySessionAuthModes (cyclomatic 12, cognitive 15): readProxySessionAuthModes has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5748}}}],"partialFingerprints":{"codehealthFindingId/v1":"402bda8a16c04d7fdeccdf4e78dae03e2a788c310ba3258d241654dfa73083dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/sink.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a385b4011e1a44848c319ea3d0c2350f7fdb8c189438c5a33acd9824ca483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/installer/provider-skills-integration.test.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b3b0c5bbfc6632d722fe1322b6bc0ff076da0796fc3a99c795b592ffc4ed9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mcpUninstall (cyclomatic 12, cognitive 14): mcpUninstall has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14745}}}],"partialFingerprints":{"codehealthFindingId/v1":"2784955f0ae6f1818f8042996b0aecce1c33418704e4f3115ed2726f49425630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fallbackGetDefaultMode (cyclomatic 12, cognitive 14): fallbackGetDefaultMode has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eafd0ffdecdf3defe55e1d6afb2b86f4fd444b60ec518ee338d060fe4d8e26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withCavemanOpenAITools (cyclomatic 12, cognitive 13): withCavemanOpenAITools has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/openai.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90dfde86cddf02e09272b87246567c3c735a4e76ab624308621a0cbec382164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveModeArg (cyclomatic 12, cognitive 13): resolveModeArg has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-parse.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9080c31f32a196b19e164e50fc893e5ae6a10f6234f58c312b3d7c7fe033f272"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agent (cyclomatic 12, cognitive 12): agent has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc0dc4356c14f0654bbd22bbb3c2bb29499e9f07537b809578bea85952ea20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrap (cyclomatic 12, cognitive 12): wrap has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5918}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6148fd269eb858bfd59fc09083e22b9d0f2da478a015cfab54adda399fc6b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWrapped (cyclomatic 12, cognitive 12): runWrapped has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e0019afb362420190268685293956bc413149fa0551c9971063eb5cf7b029c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectLeaves (cyclomatic 12, cognitive 12): selectLeaves has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ad4782210f9e76ec3581ea0e9f7796fd2db67bb818a1a6556f03de3b8e348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4813d43251e6491f8ad03036bd7732aad6ebe32a476999f600f8ee98fcbc6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/index.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0223f2f173db89f2acb1ce4d6bd0af495943a1e6397e18db28ed13baa38f70c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shrinkHook (cyclomatic 12, cognitive 11): shrinkHook has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17416}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddb83c4e93ee4e15e4ebb20be415d86de21324e2c79d14d97c633077b2370fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moduleFix (cyclomatic 12, cognitive 11): moduleFix has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/status.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6b6b4f7f34b976bb4fdb05b06bf10303186062d48e7a8e72e7ff08fec36b99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 12, cognitive 11): request has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e0a21da7f56183f682073c673d9ab984f90c5c0dd3b079976c769470c7ec9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restartOutdatedRuntime (cyclomatic 12, cognitive 10): restartOutdatedRuntime has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1008745c62b5ff4e4d8e85fc0f3b878c4e3010772bcecf6ca78dd81721e524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermesHostDerivedApiKeyEnvName (cyclomatic 12, cognitive 10): hermesHostDerivedApiKeyEnvName has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78f79562b043dd49fa35cea2e876549ef125c88c2d83f28b5594b0f21ba1ed9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8481}}}],"partialFingerprints":{"codehealthFindingId/v1":"386289284d1bf320a6be1dd0351e284d101e2942b0796cfb0830e97c41b04c93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFirstRequest (cyclomatic 12, cognitive 10): verifyFirstRequest has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe94040ffff610c86b303da0be2c54fc494f24594d944d50a880cde167c71cd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 10): constructor has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a957b5dbc6336185fbd1cacb20db2a7f6c084684de0c49c806fa4b4b1d132389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildResponse (cyclomatic 12, cognitive 9): buildResponse has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/sink.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cb8f05265d3652620957c0f1953714bd83caa12ea614009d78bd1e283a9ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withIndexLock (cyclomatic 11, cognitive 26): withIndexLock has cyclomatic complexity 11 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"54caecb5c22c38992f3f677f019f83e2d23e30abf46cc9c448dec2e37fd123a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureModuleBinaries (cyclomatic 11, cognitive 23): ensureModuleBinaries has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f409e12f42ace84aa9238a5890a2b786f3c370412dae3dab0a593d567520ea7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function geminiRouteShadow (cyclomatic 11, cognitive 21): geminiRouteShadow has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9052}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2f1a898b73ad96589dec08ce0708ff76cb2d191c1ea7901029f9dd29f34b77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function durableCavemen (cyclomatic 11, cognitive 19): durableCavemen has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a387becbe4faa9c265e334fa7e408ad965bfc6c9ded223441e7b59fa7d886b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sync (cyclomatic 11, cognitive 19): sync has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13755}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc2a98754c522eaf7cc736aeffc99a340e330fab9285aacb2a1f3ce23fb225"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRepoConfigPath (cyclomatic 11, cognitive 18): findRepoConfigPath has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbb5d49981eb7226894c7935f80c70545410fccdf2fe9481094fe423aa3b685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyModeChange (cyclomatic 11, cognitive 17): applyModeChange has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"864972831758bfa8f1d2a7d1ebdd96eefceff3c0951c301bc92b27494fd0f59f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #http (cyclomatic 11, cognitive 16): #http has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c331d16728cd4b3df232e145741b446558bc4c600da047361faa07b1a91b627"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function killProcessTree (cyclomatic 11, cognitive 15): killProcessTree has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4ca1844593665ca8b26056dc1d08289e4b0bd2f6c7ac94e62419203bd9a2cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexNativeRestoreText (cyclomatic 11, cognitive 15): codexNativeRestoreText has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10021}}}],"partialFingerprints":{"codehealthFindingId/v1":"3551bfd49c4e68bf70288d9b9a28cab27be84c531faf00153f57428fa89255b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providersAdd (cyclomatic 11, cognitive 15): providersAdd has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d540cb5714fc4795c9bfe16dc5c1db183f81a87c2ef58c559c1d4200fbc4849f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/agent-compression-conformance.runtime.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6864c919113ee00aea0fcb405c16c1bdf84281f4874bed242cfe07cc101961"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsCommand (cyclomatic 11, cognitive 15): resolveWindowsCommand has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/process-tree.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"79df332ac500267214d0a1d7d4f31a040d5aa5a04663ee16c9b64cabd43c3b1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsCommand (cyclomatic 11, cognitive 15): resolveWindowsCommand has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp-servers/caveman-shrink/spawn-options.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba70d5805ef45cdca25bfaec01fcb5230a55fea167af74290ddca4fe785e6a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 11, cognitive 14): install has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/provider-skills.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7d6f019344a84b43dbfcba829765aa67630bf36b4beeb77050664391adc81f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHookFields (cyclomatic 11, cognitive 14): validateHookFields has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd44ef6c1f0fd697342b04d135a1fe32a33d5aa5565a3130e91d3e2c969f964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureCavemanHome (cyclomatic 11, cognitive 14): ensureCavemanHome has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5313dfb435e509c761c1da24757e6f82a4479260a17b582baf67c3961c63e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proxyAwareFetch (cyclomatic 11, cognitive 14): proxyAwareFetch has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/proxy-fetch.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"479bd259c7f642da1b9a5b9751eb3a588694ab8ba5bf685935130c1cf960a639"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readModeLog (cyclomatic 11, cognitive 14): readModeLog has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed639dd0bf71b92cca02cf64499fb8263043f818a3d7f32488b3496e84d846f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownEndpointIn (cyclomatic 11, cognitive 13): ownEndpointIn has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8810}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2326804e3e52726420eb1babe0304475c43349fb4ba3a9b455d90b369b2479"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeRepositoryState (cyclomatic 11, cognitive 13): nativeRepositoryState has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce6414cee6187d79b139cbfbfe18036c96935198ab59373baf09f8a8f4cd1be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repositoryState (cyclomatic 11, cognitive 13): repositoryState has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93fc19795b9797c5faa3823d8d210dba2a9bf27eaa193c4047cdc7376a2db20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatewayUrl (cyclomatic 11, cognitive 13): gatewayUrl has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78c8e15b4030945b572e9f5e61c3d8f092c441ca54e55770d86e852d231d1e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sha256Sync (cyclomatic 11, cognitive 13): sha256Sync has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/validate.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e94daf66d830604fbe9d686c97f2593a2f28a7e0f1974e29b337990385777d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 13): walk has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-schemas.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c687bd95f51419a4efa4509e2df33e8284450226bd1b8aeb5b1d3717d07c8460"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireSibling (cyclomatic 11, cognitive 13): requireSibling has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb9a72ea7d5cba355cc4af6aa12abe9140c2555bc28181ff8239c6db97a768c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireSibling (cyclomatic 11, cognitive 13): requireSibling has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c502d480865cf9cac25ec8afeda3542f0834c11e8a20f78d3bfddc0d76308c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function opencodeUnroutedActiveProvider (cyclomatic 11, cognitive 12): opencodeUnroutedActiveProvider has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9724}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ed2d52e0d058d37fcbacfe4a5eaadb21cbd27eea863280a418f6e63a11c27b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyClaudeBedrockWrap (cyclomatic 11, cognitive 12): applyClaudeBedrockWrap has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073d312453a9370a3a9760a6b2cdb2277ee972bc1f51d0410b8129d2a9e729a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installManagedBlock (cyclomatic 11, cognitive 12): installManagedBlock has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded4c3e77af030b28194253b3f3cc13893ac8c2cb814267875c690cc59445861"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learnScoreBody (cyclomatic 11, cognitive 12): learnScoreBody has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-tui.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ed37fd0a0152d14980af2f647390e76d6effc31f99c6e6981d1dc07a4da680"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressDescriptionsInPlace (cyclomatic 11, cognitive 12): compressDescriptionsInPlace has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp-servers/caveman-shrink/compress.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b700caf506347fea2918afb987aeed048a010945ba88be68fde24caad8f790"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installCodexHook (cyclomatic 11, cognitive 11): installCodexHook has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ac515d6cd3b1b77c8c343fcc758f3d8c9b88ff7bb8c68c944dcbfc34458cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capability (cyclomatic 11, cognitive 11): capability has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6946b23238d783be5ae3adbeedab095e3a8fd31c6a095608ae3f7b772e137d29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disableNativeAgent (cyclomatic 11, cognitive 11): disableNativeAgent has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bbf2f60019b41d99a482cbb092aa0da196c0b2fa695b75d69b1372d474123b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatewayNoProxyEnv (cyclomatic 11, cognitive 11): gatewayNoProxyEnv has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d953845d39df14030c1f423e5f231c513c479a02b000d164219398faf3c2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-leaves.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"854a5f6c36390d51ebc67c47517d87ce0c6891bf8ad7f94927d7e3cd0f34cbe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 11): fetch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/tests/middleware-v1_1.runtime.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc63908786064173a8279617bd08d04ebe0696f14d695ed68f361f0eb617ff17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureBinary (cyclomatic 11, cognitive 11): ensureBinary has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcf981000e6fa841e963887aa0b79939e06f4fe851627ee9d65110622930bbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function injectAndSend (cyclomatic 11, cognitive 10): injectAndSend has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d60dd9b0cd9d5b2361164b467bc8ddf652659447eb2496ed0831f542b854cdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProxyTokenTotals (cyclomatic 11, cognitive 10): readProxyTokenTotals has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"53186e342fc973d81adda18c728caf0ae62e8ffdaeef9f429930662ee2f43673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchAndStoreWrapEntitlement (cyclomatic 11, cognitive 10): fetchAndStoreWrapEntitlement has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a252c2e6b03a2308f2cee5633b1630a2366a8af84f13eeb9d00cfe868f00d561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeCaveBuildEnv (cyclomatic 11, cognitive 10): claudeCaveBuildEnv has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7017}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baac397f4504439a2fe80282f33c77f3371c152b87c9e9c6d5a890394569c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativePolicyMode (cyclomatic 11, cognitive 10): nativePolicyMode has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072376048a059a22fa29000ab1f5c5c1102e3d5192be1bbb92caaf1714ef96f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeWhy (cyclomatic 11, cognitive 10): nativeWhy has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18000}}}],"partialFingerprints":{"codehealthFindingId/v1":"db85f149f76b21ec9774800a68a730712db02b91f463f5a3910e0ccfd4d5856b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summaryRows (cyclomatic 11, cognitive 10): summaryRows has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a927fc88d3b595e44de6d6f70b2320cec7d5ffe69463e42fe37121e387e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configuredMode (cyclomatic 11, cognitive 10): configuredMode has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5a94c5e80b646389bbdba1d992c411a8209b316db8f503dd77e4791c641fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policyMode (cyclomatic 11, cognitive 10): policyMode has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cff95ad4d4fe7cebbf208aac4aeb6433efb5ef98d1ddbd4001ca43fe0009502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openClawRequestCompatibilityIssue (cyclomatic 11, cognitive 10): openClawRequestCompatibilityIssue has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/openclaw-provider-compat.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaca76574028ddf10a9271054350ed3e7977da847845e6a09a1d07efb03695b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeForApi (cyclomatic 11, cognitive 10): routeForApi has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/protocol.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed533c4eddf1e0eab018509e046dbf0274929c8cb6137da612f60b6083cd12b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telemetryContext (cyclomatic 11, cognitive 9): telemetryContext has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e3f57fe3cda598381ea638aa5c374975507320e527a00c5870af53526d1aa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentMcpProjectId (cyclomatic 11, cognitive 9): agentMcpProjectId has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaebb9ad7298183c93afb2fec714a55fa8935416dfb32e1c64048809f61517f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a9f0d55b777fe3a65f6d1da1a5c76f99554816a5e62a2d10b36ce54ce25c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function warnOnce (cyclomatic 11, cognitive 9): warnOnce has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"577279bda4ab9001c57bedc942ce231d4c302ce5e5e5e0b9f88cfbfa98606899"}},{"ruleId":"R3","level":"warning","message":{"text":"installer/install.js: 2791 lines of code: installer/install.js has 2791 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f4c29913c358d61d8f3c24e3b35181f9570317943afda626b350201904e895"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/sdk/typescript/src/index.ts: 2306 lines of code: packages/sdk/typescript/src/index.ts has 2306 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1c794ed10cd32e5ce5f6e445c5c6634907b59e1ae09ba1aebc65fd9d636393"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/caveman-config.js: 851 lines of code: src/hooks/caveman-config.js has 851 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862f7fffe3ebfc63d69c1d1e1d3dbab481f3288dc355a08873c5d706780eed6d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/modules/onboard.ts: 815 lines of code: packages/cli/src/modules/onboard.ts has 815 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3885aa3d497660e80a52e6ebaeee2ac1c661b4bbe760d11cca849eaf0b368a56"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/sdk/typescript/src/middleware/runtime.ts: 654 lines of code: packages/sdk/typescript/src/middleware/runtime.ts has 654 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b2dfa4287b3007533b81590d3a4254f22d874bf7483fa66de5cac51e9a6103"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/agent-mcp.ts: 651 lines of code: packages/cli/src/agent-mcp.ts has 651 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caa51d823ba332abe00cef267967d8dcaa86bb3179a9cb1973cc368a533a578"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/modules/apply.ts: 645 lines of code: packages/cli/src/modules/apply.ts has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8a2dbf627a4b114e1c780c1eecbf24fe68c7e4abd2edf26e090e70d2ecb6cc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/caveman-stats.js: 609 lines of code: src/hooks/caveman-stats.js has 609 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f1a51c14609cf80245a09e1cdfc7fe4a70aedfb6d545ce3d58c6637667b508"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/caveman-activate.js: 596 lines of code: src/hooks/caveman-activate.js has 596 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c679763e02d5f2777af6345a005daa26e49208c059544df284ed4963ac92039"}},{"ruleId":"R3","level":"warning","message":{"text":"agents/compile.mjs: 588 lines of code: agents/compile.mjs has 588 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"350892950229f60652d99768156678d5bc42d38fae6f43af7bc6d39a43306230"}},{"ruleId":"R3","level":"warning","message":{"text":"installer/lib/openclaw.js: 478 lines of code: installer/lib/openclaw.js has 478 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5d16aebfa414f2339ee4ab468aa1047eab9ca51fadd19213c3d892b35a129a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/native-hook-fast.ts: 471 lines of code: packages/cli/src/native-hook-fast.ts has 471 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e73d1083db23e28ca1da789f2cc0ed6548a4e3ec1d4c3124776df17040c63dd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/shared/contracts/conformance/run.mjs: 467 lines of code: packages/shared/contracts/conformance/run.mjs has 467 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/conformance/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91671eddc1854b457a0b3e364fbe7527afc6dec65357882472224482750091db"}},{"ruleId":"R3","level":"warning","message":{"text":"installer/lib/settings.js: 436 lines of code: installer/lib/settings.js has 436 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd3f3419acb7238d0e1941698ae282da5b65363b194923f9f33f47c0b6d208c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/hooks/caveman-mode-tracker.js: 431 lines of code: src/hooks/caveman-mode-tracker.js has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6126c0cfbede91fa8d65aa0d4477169b7e83b6b25647930841b0829455987a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/subagent-tax/run.mjs: 401 lines of code: packages/subagent-tax/run.mjs has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4b5588d6defdcfc78481b5d3e0607e4e274a2a68ba47cd4afe60709aef411"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/middleware/typescript/tests/required.mjs:4 imports \u0027./\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/tests/required.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a1dbafd73b02be63015ce6924c613c575d338ee98dc0345a62b5dfee66f827"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/middleware/typescript/tests/versions.test.mjs:185 imports \u0027../src/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/tests/versions.test.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"328766aa54fee22572349dec4172262a678af4d3668a3bfd019f4ded8b3d8b49"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/pi-extension/tests/provider.runtime.mjs:9 imports \u0027./core/provider-attribution.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/tests/provider.runtime.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609d112722d0f2b5dd413c02247c75031b5135921e5e1840d09c4b871714e08"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/conformance/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737ebe122e472c63777df440770ea0a9e6a385cb8c89699518192cda9706c4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07564786b4e267f32645a5e9528d8a318ee6c5857a89bf0ea49014800e549c44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/plugin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6139e5825c945a0480f05737e6930ac83feecd99faef2e8456208a7a922579"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-continuous-improvement.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ca9a627d5b4c4746c2399cfbc6375a78db1fb1b84308d7058e3726891b899"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drift-report.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2276baf4b5ee62f9dade1d8b7e9f3e7bd25086352f7727fe21c743977fa78d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/compile.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f30a77fc0174106ba9b599bf20237cc6c5bfe5a30c26e55a64072f5a6fc52e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9705ec0f85d8c6b202799ba114e99611fa4ee27b0f8254fd4c1c283201e91ce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/probe-installed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb854059f62626d1ace6cd1d62c1206e4e2668fe88706e2b0f9f8ccfa2fea07"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/internal/atlasgen/gen-golden-anthropic.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aef69bd2d9b632de813d6d1fa33e24831328c9572d3bfba548837db33e7efc6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/build-extension-zip.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00861346cad85718a3f67e0f357570a8f67ccfd32d732e16d91de812d590165"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/internal/atlasgen/gen-golden-openai.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72622a914a6a550d4db8d06de3667b729aa13fac2a26a62c2a899bc2223468bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/internal/atlasgen/gen-golden.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebbf89db426e93dc36cccb286d91efa8154d60a738d2c56a25fee7d0af3295b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6300ebcbca7a1d318e3b54bf8e9ea3f3522c97224ac4319cc41f22232c142a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/internal/atlasgen/extract-atlas.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf409c0ff68e58ff86789b6007c20d9e91201801c68c94c95b99cd6fb33ce9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b425b889c358c5c9a81760ad655a897f8630f0a62001d424cb7bdea2ae796836"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a4830ba3526ca2e719a62f01bab499a6d77e6829ceb6f61f059a0cf250fcdc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/scripts/check-latest-in-range.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b22bca10544c3b93507919aa9080805436d727bc14be297f6c804031f7cc4a6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cc4f5984defd0c9362d3673671d8b9e2fddb01bab149eff8e7cc936846b9f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/render-store-assets.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba528f5f573d04d0c17b3be90629be98d7dd1e9fa654bce5930a7da4ae92d9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/scripts/cjs-types.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2094f5066a409945456cceef3a8799187e0afc2194d31f13496b48ad20678927"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/scripts/playwright-aria-baseline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f55f3c43d8ffcecc9168ec5811ffbb27f3caacf4692d8f04f2ee6af93e69637"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/scripts/bundle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4c950a06b4d310233bf4fff6c3bca463c21ea20032c73e360f756e1b9ed43f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/scripts/cjs-types.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"505200d0f676952030c519c0828c6a56e181814b5de6ecb0342b73b61760324d"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but packages/middleware/typescript/tests/required.mjs and 2 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/tests/required.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f66c859e7a03f8e033eeb1c29c69e42b5714f3cb6c967cd79f93b4c0c7622c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~340 LoC): no import path from any entry point (270 application, 60 tooling, 303 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/scripts/validate-continuous-improvement.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128e0fd9ae8eabfef608545090d773248b40ac18c04e5a44fbcc99ed5bc05d2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~298 LoC): no import path from any entry point (270 application, 60 tooling, 303 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/compile.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dbdaf8dc4cec5a2ef8c57c29478e070801df09c5dd22ac05f306d24a1ff6fa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~213 LoC): no import path from any entry point (270 application, 60 tooling, 303 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (skills/compile.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/verbs-gate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fd3cb149587e5b006e9be750c13091865d5d6bc62e72fa3fc7cbb6431cd45"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~97 LoC): no import path from any entry point (270 application, 60 tooling, 303 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17acae3492f2c9e5b9f21523f03364d53db6c4ea0047d9c852e8f21e4958e3ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ensureBinary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db331735ff604421040032aa21bc6f4ce78f4a8c60af0f81f1716aa0e1aef62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027derivedCompleteness\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/compile.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"557435886ab8f9e66b3342b2b80f99fed8824f8afcca9eefcf101793bfec7f05"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mcpMarkerPath\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13961}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b573076f89904f89f1c4271271f90f64ac6f0f266e71d1edd7979df5d5c9e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recallHookInstalled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3460a559f02958d261e2ec1041fae74e3d6cde353fdfd014a3e31ceab13b8444"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027shrinkHookInstalled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19359}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9acf2a34979f250f9abd7ccbc82155c517d83761fb4ae3fc8e1d2ba2453784"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027dockerState\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23377}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f072939ad4b24638a4e98496e2f0da610a95ded9b1368c4285373870999e42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_empty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/tests/task-profile.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eede89f999da57e74a8a32ea957a8e643af9e6694771d77a639a8eb361c235b6"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ai\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/middleware-e2e/drive-ts.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d98cdea24984b7edf56599a31a631aed3d0fa247101ba9243a419550e004e0"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@playwright/test\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/scripts/playwright-aria-baseline.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"664db491020a72631c2077a599efb39a932aa412d47baae91f2ab88757c116ba"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/cli/src/index.ts \u2192 packages/cli/src/modules/index-file.ts \u2192 packages/cli/src/index.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"398f755c5606ab83ead593978e0ac9744ba224a8627b05b2a715e98e70d0fbf2"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/cli/src/modules/apply.ts \u2192 packages/cli/src/modules/cloud.ts \u2192 packages/cli/src/modules/apply.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec251a4bb35d20e51bf803c0588df4a20c4f57d9274e20b5462b17979baa87a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!event.Timestamp.IsZero() || event.ContextUsagePresent || len(event.TextPayloads) \u003E 0 || len(event.ToolCalls) \u003E 0\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/learn_portfolio.go, proxy/internal/store/session_source.go. 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":"proxy/internal/store/learn_portfolio.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8b93d6dacd6688db296588fc2854ccddc9894a2ad5aa14454e949daf75696"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ok || messagesSpan.start \u003E= len(body) || body[messagesSpan.start] != \u0027[\u0027\u0060 appears character-identically in 3 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/anthropic/content_compress.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccbcd41e28442ba01ea2b245fffbce9c744de9807143de23cede17763a94bc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!since.IsZero() \u0026\u0026 !ts.IsZero() \u0026\u0026 ts.Before(since)\u0060 appears character-identically in 6 files \u2014 proxy/internal/store/source_claude.go, proxy/internal/store/source_codex.go, proxy/internal/store/source_gemini.go, proxy/internal/store/source_opencode.go. 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":"proxy/internal/store/source_claude.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe635729add9b612ecf2774a7d9753cd05ce4368b270bc31b7976dc6f94733"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!utf8.Valid(input) || len(bytes.TrimSpace(input)) == 0\u0060 appears character-identically in 2 files \u2014 engine/compressors/config.go, engine/compressors/tabular.go. 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":"engine/compressors/config.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce313a987f033e21c300564b6ab7f093f032d1988f80ab9a71a65e16694aef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arr.start \u003C 0 || arr.end \u003E len(body) || arr.start \u003E= arr.end || body[arr.start] != \u0027[\u0027\u0060 appears character-identically in 3 files \u2014 proxy/internal/gateway/retrieve_tool.go, proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d0c6d77652279b2496908938fdda7a05ec29274f041df37c3d4f70c7780b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.start \u003E= block.end || body[block.start] != \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/anthropic/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5fa4bc8f7d6ecc8671ef9eb5de978fd68fcb331246c985ee6e695f182ab57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027 \u0027 || c == \u0027\\n\u0027 || c == \u0027\\r\u0027 || c == \u0027\\t\u0027\u0060 appears character-identically in 2 files \u2014 engine/compressors/toolschema_annotations.go, proxy/internal/translate/jsonfast.go. 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":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"25feafb210101f61bdcae56c2f1a5fe1c0540687d90342831e64616a3e624ea5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.start \u003C last || c.end \u003E len(body) || c.start \u003E= c.end\u0060 appears character-identically in 2 files \u2014 proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/providers/anthropic/splice.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c09f23506d58a1a5d7fff406bd766c482a74288dcaa48b15acc05c218fa83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content.start \u003C content.end \u0026\u0026 body[content.start] == \u0027[\u0027\u0060 appears character-identically in 3 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/anthropic/content_compress.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83f54cbb0af415484fa200020b51044de0585823c73340d50e5f9b1360d115f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content.start \u003E= content.end || body[content.start] != \u0027[\u0027\u0060 appears character-identically in 2 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64be8c5fa95413cbfa627a41108285fb345a5974b096d915d13e5f0aed97a0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil \u0026\u0026 !errors.Is(err, sql.ErrNoRows)\u0060 appears character-identically in 2 files \u2014 engine/ccr/store_repair.go, engine/ccr/store_sqlite.go. 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":"engine/ccr/store_repair.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"22759a16d2cb184d4e2263ff8fa08db87baba64cb947fb47deaabeb1d50f04eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || d.IsDir() || !strings.HasSuffix(path, \u0022.jsonl\u0022)\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/source_claude.go, proxy/internal/store/source_pi.go. 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":"proxy/internal/store/source_claude.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"124db68e0d7dbd14aaa01fe912cca51bfcef9d371da4e7edb02f906e1e5ea269"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || rel == \u0022..\u0022 || strings.HasPrefix(rel, \u0022..\u0022\u002Bstring(filepath.Separator))\u0060 appears character-identically in 2 files \u2014 engine/evals/harness.go, proxy/internal/store/learn.go. 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":"engine/evals/harness.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e8ac1b17c6c5f46490fe2fe1d343e2bac6a0457e75dbcde4c2194063f1bb99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.Response != nil \u0026\u0026 event.Response.Error != nil\u0060 appears character-identically in 2 files \u2014 proxy/internal/translate/chat_stream.go, proxy/internal/translate/messages_responses.go. 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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ad561bea96d824f9bf305ec0fb8b4daff958060f42c7dbce16ca4be27e32c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh64 \u003C 0 || cached64 \u003C 0 || out64 \u003C 0 || fresh64 \u003E math.MaxInt || cached64 \u003E math.MaxInt || out64 \u003E math.MaxInt\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/source_codex.go, proxy/internal/store/source_gemini.go. 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":"proxy/internal/store/source_codex.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d662637763272b41e268fbd029dd231f7f69c7bd92e7503ed4b3a038522bccd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh64 \u003C 0 || out64 \u003C 0 || fresh64 \u003E math.MaxInt || out64 \u003E math.MaxInt\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/source_claude.go, proxy/internal/store/source_opencode.go. 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":"proxy/internal/store/source_claude.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c80e09e932772e34f87550d21fba0c67ee750dd0b2c63616a4eb39fc37fbec7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.start \u003E= item.end || body[item.start] != \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"636816c7de77fabadd1cd9b77589ed15dc67888f98e19711c5d9c47d8c387e7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(original) \u003C minCompressBlockBytes \u0026\u0026 !(allowForcedTOON \u0026\u0026 forcedTOONCandidate(original))\u0060 appears character-identically in 2 files \u2014 proxy/providers/anthropic/content_compress.go, proxy/providers/openai/content_compress.go. 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27020af6d7cce264c4d8c5c103d155458f9d35aa30f6e01eb9025f9caaa72f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(start.Input) \u003E 0 \u0026\u0026 string(start.Input) != \u0022{}\u0022\u0060 appears character-identically in 2 files \u2014 proxy/internal/translate/chat_stream.go, proxy/internal/translate/responses_stream.go. 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":"proxy/internal/translate/chat_stream.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deb123ee6f5ef75f547d44865530a546ceec3432830dbd349e59452b48a2158"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(trimmed) \u003E 0 \u0026\u0026 (trimmed[0] == \u0027{\u0027 || trimmed[0] == \u0027[\u0027)\u0060 appears character-identically in 2 files \u2014 proxy/providers/anthropic/content_compress.go, proxy/providers/openai/content_compress.go. 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":"proxy/providers/anthropic/content_compress.go"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd99056d5ee30c431d78acc7ecf7faf4e633e1ce934e42cc544d112df037c56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line == \u0022\u0022 || strings.HasPrefix(line, \u0022:\u0022)\u0060 appears character-identically in 2 files \u2014 proxy/providers/adapter.go, proxy/providers/bedrock/usage.go. 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":"proxy/providers/adapter.go"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d99bdeffe6dc28cede31057ee311931dd0b9809bf5f4f3b45fd15e05ebdb43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metric.Observed \u0026\u0026 strings.TrimSpace(metric.Repo) != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/learn_outcomes.go, proxy/internal/store/learn_portfolio.go. 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":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5682761608c2bc7443312ec9f8265a3a81335ddc5fb56b1f148472d937948"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj.start \u003C 0 || obj.end \u003E len(body) || obj.start \u003E= obj.end || body[obj.start] != \u0027{\u0027\u0060 appears character-identically in 4 files \u2014 proxy/internal/gateway/retrieve_tool.go, proxy/providers/anthropic/frozen.go, proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6405948fed7ec426bb0dde06693a318b9e50ba4c7186a940ba8cfc34fdd934ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part.start \u003E= part.end || body[part.start] != \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce28a4b8cfc306c0293a2c5c76bf493837f1480b2e4d96a51048e68dff4e35e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060policy.AuthMode != \u0022\u0022 \u0026\u0026 policy.AuthMode != \u0022payg\u0022\u0060 appears character-identically in 2 files \u2014 proxy/providers/anthropic/cache_breakpoints.go, proxy/providers/bedrock/cache_points.go. 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":"proxy/providers/anthropic/cache_breakpoints.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fabb3084233db67d92faea952a19e1ea5d61f32d67a926b62d999cabf2ab72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060read64 \u003C 0 || creation64 \u003C 0 || read64 \u003E math.MaxInt || creation64 \u003E math.MaxInt\u0060 appears character-identically in 2 files \u2014 proxy/internal/store/source_claude.go, proxy/internal/store/source_pi.go. 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":"proxy/internal/store/source_claude.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c0dc4df59981b792a01b2157bc8db63c073eea4a35ba21d8f5f125df5662f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rep == nil || bytes.Equal(rep, c.original)\u0060 appears character-identically in 2 files \u2014 proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/providers/anthropic/splice.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bc3037d55e13829d0a1702cb71b16a491cce31a2da0257e3c3c43d59435c8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.Mode == \u0022record\u0022 || r.cfg.Mode == \u0022record\u0022\u0060 appears character-identically in 2 files \u2014 proxy/internal/middleware/choices.go, proxy/internal/middleware/runtime.go. 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":"proxy/internal/middleware/choices.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a159b56007dad0b5db02fbec07102bc0c476515f814cab2d37cc2ef9ea8020e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resp.StatusCode \u003C 200 || resp.StatusCode \u003E= 300\u0060 appears character-identically in 2 files \u2014 browse/cmd/caveman-browse/main.go, proxy/internal/store/usage_import.go. 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":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"680af0bd2e4c1ddb6e944138acf674a90adbd62f18b1f3addab30d757fc8d577"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime.GOOS != \u0022darwin\u0022 || os.Getenv(\u0022CAVE_NO_KEYCHAIN\u0022) != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 proxy/internal/cloudlink/link.go, proxy/internal/pool/pool.go. 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":"proxy/internal/cloudlink/link.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0297671d111c56950791e76d98b498c15feb2c3cbafd335148755c8d5763d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span.start \u003C span.end \u0026\u0026 span.start \u003E= 0 \u0026\u0026 span.end \u003C= len(body) \u0026\u0026 body[span.start] == \u0027\u0022\u0027\u0060 appears character-identically in 3 files \u2014 proxy/internal/gateway/pixel.go, proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/pixel.go"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a761c1ff04766d8cd5c65dea26b5eda5bb59c1a8b9820c3f52456c57145ab53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E= len(body) || body[start] != \u0027\u0022\u0027\u0060 appears character-identically in 5 files \u2014 engine/compressors/toolschema_annotations.go, proxy/internal/gateway/retrieve_tool.go, proxy/providers/anthropic/splice.go, proxy/providers/jsonsplice/jsonsplice.go. 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":"engine/compressors/toolschema_annotations.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c81a5edb076f7f74c6638858434c4d9c48cbb27865f93b1ac4109823018179"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E= len(body) || body[start] != \u0027{\u0027\u0060 appears character-identically in 3 files \u2014 proxy/internal/gateway/retrieve_tool.go, proxy/providers/anthropic/splice.go, proxy/providers/openai/content_compress.go. 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":"proxy/internal/gateway/retrieve_tool.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"014eac25e237b96f494e2e1ab75441809143e65d1e884b757c528c26c9afabe2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == entry || (prefix \u0026\u0026 strings.HasPrefix(value, entry))\u0060 appears character-identically in 2 files \u2014 proxy/providers/bedrock/routing.go, proxy/providers/vertex/routing.go. 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":"proxy/providers/bedrock/routing.go"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5966bd71274e11b1e7ec9e956f334ca6014282088fba94d9d14049f42d7db1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(os === \u0022darwin\u0022 || os === \u0022linux\u0022 || os === \u0022win32\u0022) || !(arch === \u0022arm64\u0022 || arch === \u0022amd64\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/shared/binary-installer/installer.mjs. 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":"packages/cli/src/index.ts"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"871c5f53aedcf7de3eea3dbe642f1a59a0ae0e9b0539702f78f5a30e62eb556f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/(?:\\bnode(?:\\.exe)?\\b|_prog)/i.test(line) || !/%\\*/.test(line)\u0060 appears character-identically in 5 files \u2014 agents/delegate/portable-process.mjs, installer/lib/portable-process.js, packages/cli/src/portable-command.ts, packages/subagent-tax/lib/process-tree.mjs. 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e882898a24cb9a48955b91e09bef609cec0a73e127ad8c2ecd4f144fb4a78ba5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(events) || events.length \u003E MAX_BATCH\u0060 appears character-identically in 2 files \u2014 supabase/functions/blocks-telemetry/index.ts, supabase/functions/cli-telemetry/index.ts. 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":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe77ef925b347cfde62d63f785caba64e5ee122d7927c2825c3d9b02c70eefd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(target) || !statSync(target).isFile()\u0060 appears character-identically in 2 files \u2014 agents/delegate/portable-process.mjs, packages/cli/src/portable-command.ts. 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"241eb99f38376f71789333e522cd5d735a6703e94d842fdb3c8bfac6f2b0d1ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fs.existsSync(path.join(__dirname, name \u002B \u0027.js\u0027)) \u0026\u0026 !fs.existsSync(path.join(__dirname, name \u002B \u0027.cjs\u0027))\u0060 appears character-identically in 2 files \u2014 src/hooks/caveman-activate.js, src/hooks/caveman-mode-tracker.js. 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/hooks/caveman-activate.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a048c2fd7342ee5f44d97f403245e33167f6308d23354f7b13fe8850857d8af2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!input || typeof input !== \u0022object\u0022 || Array.isArray(input)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts, supabase/functions/cli-telemetry/ingest.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25dfeb7c9fe7fcd0ed155ec85776910fe0c9ac2f7a0b5e931ae323252d4fbb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!input || typeof input !== \u0022object\u0022 || Array.isArray(input) || !cwd\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17688}}}],"partialFingerprints":{"codehealthFindingId/v1":"85adca897e642cde7868ce2b7978520471be387573c1369ed76e0eec4a10d3b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"243017e1356b4a68b64d96ca1084e1440744f1d03d02cb085eab52fc71013f11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!plain(message) || !Array.isArray(message.content)\u0060 appears character-identically in 2 files \u2014 packages/middleware/typescript/src/ai-sdk.ts, packages/middleware/typescript/src/provider-leaves.ts. 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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8d34d4518a059c159ef0a31d78a95f9b9714e0fe3867e9f6209de7ec48fa5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!plain(part) || part.type !== \u0027tool-result\u0027 || part.toolName === \u0027caveman_retrieve\u0027 || !plain(part.output)\u0060 appears character-identically in 2 files \u2014 packages/middleware/typescript/src/ai-sdk.ts, packages/middleware/typescript/src/mastra.ts. 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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb7bdf7a0d987ae377ba36a7867b0812dc917249285ab24d16b16dfa777adae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!prompt || prompt.length \u003E 160 || prompt.split(/\\s\u002B/).length \u003E 14\u0060 appears character-identically in 3 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts, packages/pi-extension/src/lifecycle.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17666}}}],"partialFingerprints":{"codehealthFindingId/v1":"76885eb3f1993cad037cbdea8a5c58a64c9f419399027b9fc845ba8ac50fc480"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0022object\u0022 || Array.isArray(raw)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/index.ts, packages/cli/src/provider-routing.ts, packages/pi-extension/src/protocol.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28fdecdbb51493e7843fee70da493c21d765b8e970d0471235c735f600ee22e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stat.isFile() || stat.size \u003E 256 * 1024\u0060 appears character-identically in 5 files \u2014 agents/delegate/portable-process.mjs, installer/lib/portable-process.js, packages/cli/src/portable-command.ts, packages/subagent-tax/lib/process-tree.mjs. 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87bcded4f105fa4c26bd7b7b0edde9b52d5392460a297963f4192632e1243ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 agents/drift-report.mjs, packages/cli/src/agent-mcp.ts, packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"agents/drift-report.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"81382c8de9ebb3527d8e926ee1ca34c2e36eb644aac3073e2a68cd992eb06c87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(output.type !== \u0027text\u0027 \u0026\u0026 output.type !== \u0027json\u0027) || typeof output.value !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 packages/middleware/typescript/src/ai-sdk.ts, packages/middleware/typescript/src/mastra.ts. 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":"packages/middleware/typescript/src/ai-sdk.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45a864aa2879b5467e41cc4e24390e07f15698a57f072c839f478b43cbf044b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^(?:sk|pk|rk|ghp|github_pat|xox[baprs]|akia)[-_]/i.test(term) || /^[a-z0-9_-]{40,}$/i.test(term)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts, packages/pi-extension/src/lifecycle.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff335f892a157d1ed5d0a196971b0caacee8741b5a198dc46088da2b2b5e414f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^\\d{1,3}(\\.\\d{1,3}){3}$/.test(host) || host.includes(\u0027:\u0027)\u0060 appears character-identically in 2 files \u2014 packages/sdk/typescript/src/middleware/protocol.ts, packages/sdk/typescript/src/middleware/transport.ts. 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":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef837b0e5956c35ed7a8ddaa379ee9b514f9c73c8b09e21a817082893593158"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(capabilities) \u0026\u0026 capabilities.includes(\u0022supersede-stdin\u0022)\u0060 appears character-identically in 2 files \u2014 mem/js/index.mjs, packages/cli/src/index.ts. 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":"mem/js/index.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"158f753076f1357cb43832cd8f0ebfc0a5abcd624c09a785de7a91464f888b7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(v) \u0026\u0026 (v as number) \u003E= 0 \u0026\u0026 (v as number) \u003C max\u0060 appears character-identically in 2 files \u2014 supabase/functions/blocks-telemetry/ingest.ts, supabase/functions/cli-telemetry/ingest.ts. 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":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0942f77ec27f3d8e4a54d4fcc71b3bbce174a78beffcb76c6f5f9f95ac4f58e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.type === \u0022text\u0022 \u0026\u0026 typeof block.text === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/pi-extension/src/recovery.ts, packages/pi-extension/src/tool-output.ts. 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":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20a630a5e7dfd26f32f43dbc67ff1136943de7bb9099399a8541f5ddcf9564"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060endpoint !== \u0022runtime\u0022 \u0026\u0026 endpoint !== \u0022mantle\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/sdk/typescript/src/index.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":12498}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79b3aa21f9eb9dfd3090aa47f0457a7acb7fb21ed99510df478847404840b59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.CAVEMAN_HOME || join(homedir(), \u0022.caveman\u0022)\u0060 appears character-identically in 2 files \u2014 packages/pi-extension/src/lifecycle.ts, packages/pi-extension/src/recovery.ts. 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":"packages/pi-extension/src/lifecycle.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"548a7afb14b7a564f7a7cb80a1326540c3fd8441beee7825e7c3d631e93f67f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envValue(env, \u0027PATHEXT\u0027) || \u0027.COM;.EXE;.BAT;.CMD\u0027\u0060 appears character-identically in 2 files \u2014 installer/lib/portable-process.js, src/mcp-servers/caveman-shrink/spawn-options.js. 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":"installer/lib/portable-process.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"750f54d40f0c69d945ea00a5354dfc88bd92f988a22331e52480691ee57dde9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060explicit !== undefined \u0026\u0026 explicit !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab26ed901e8c4cfb775a33fa31685c85266da02060d4fe8e4b1d70712b45f41e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isAbsolute(command) || /[\\\\/]/.test(command)\u0060 appears character-identically in 4 files \u2014 agents/delegate/portable-process.mjs, packages/cli/src/index.ts, packages/cli/src/portable-command.ts, packages/subagent-tax/lib/process-tree.mjs. 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab0dff5e7febd163d1aa0facbfeaa0471d1e706e0b687b5f20b122c42ee110"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.match(/\u0022%(?:dp0%|~dp0)\\\\([^\u0022\\r\\n]\u002B\\.(?:cjs|mjs|js))\u0022\\s\u002B%\\*/i) || line.match(/\u0022([A-Za-z]:[\\\\/][^\u0022\\r\\n]\u002B\\.(?:cjs|mjs|js))\u0022\\s\u002B%\\*/i)\u0060 appears character-identically in 2 files \u2014 packages/subagent-tax/lib/process-tree.mjs, src/mcp-servers/caveman-shrink/spawn-options.js. 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":"packages/subagent-tax/lib/process-tree.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d48597589ea91188bffd34253c5f17845b4d691b753bf333041b75a2ec8b5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.match(/\u0022%(?:dp0%|~dp0)\\\\?([^\u0022\\r\\n]\u002B\\.(?:cjs|mjs|js))\u0022\\s\u002B%\\*/i) || line.match(/\u0022([A-Za-z]:[\\\\/][^\u0022\\r\\n]\u002B\\.(?:cjs|mjs|js))\u0022\\s\u002B%\\*/i)\u0060 appears character-identically in 2 files \u2014 agents/delegate/portable-process.mjs, installer/lib/portable-process.js. 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":"agents/delegate/portable-process.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a611d10794275086691ce8923958e9d9c22e2aeba6fdd957b9d63f883b9a89b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.runtime.mode===\u0027compress\u0027\u0026\u0026!blocked\u0060 appears character-identically in 2 files \u2014 packages/middleware/typescript/src/langchain.ts, packages/middleware/typescript/src/openai.ts. 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":"packages/middleware/typescript/src/langchain.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc4f3042b4ae290b0f5758ca2a6c6ff3e24e7101a1249641fcd4f600350e45a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed \u0026\u0026 typeof parsed === \u0022object\u0022 \u0026\u0026 !Array.isArray(parsed)\u0060 appears character-identically in 4 files \u2014 packages/cli/src/index.ts, packages/cli/src/learn-autopilot.ts, packages/cli/src/modules/config-home.ts, packages/cli/src/modules/onboard.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":5203}}}],"partialFingerprints":{"codehealthFindingId/v1":"995434d479fb8ec5ca6672fbffa12515856f1e90a4549930d3bc79ca0baae931"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.isAbsolute(command) || /[\\\\/]/.test(command)\u0060 appears character-identically in 2 files \u2014 installer/lib/portable-process.js, src/mcp-servers/caveman-shrink/spawn-options.js. 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":"installer/lib/portable-process.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea5253ac879043a3125ab37a50a100203c1670a6d8fb30d2e8298aaf31281fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prev \u0026\u0026 !INDEPENDENT_MODES.has(prev) \u0026\u0026 prev !== \u0027off\u0027\u0060 appears character-identically in 2 files \u2014 src/hooks/caveman-mode-tracker.js, src/plugins/opencode/plugin.js. 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/hooks/caveman-mode-tracker.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfbfbac48d447bde979a7c405b7643ac7a5fdfef8f910b237e48880992b13f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060primary \u0026\u0026 primary.code === \u0027MODULE_NOT_FOUND\u0027 \u0026\u0026 message.includes(\u0022\u0027./\u0022 \u002B name \u002B \u0022\u0027\u0022)\u0060 appears character-identically in 2 files \u2014 src/hooks/caveman-activate.js, src/hooks/caveman-mode-tracker.js. 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/hooks/caveman-activate.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3840343197399bd02a39811e0fbd2064379b0dc719608e377a24ab5d855b5d29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.APPDATA || path.join(os.homedir(), \u0027AppData\u0027, \u0027Roaming\u0027)\u0060 appears character-identically in 3 files \u2014 .codex/codex-sessionstart.js, src/hooks/caveman-activate.js, src/hooks/caveman-config.js. 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":".codex/codex-sessionstart.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2161bd11d1769b35485a0f7de0cb92a1bf707ae2af96d5e09ea5bac28f73ab97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAVEMAN_DEBUG === \u00271\u0027 \u0026\u0026 error.code !== \u0027ENOENT\u0027\u0060 appears character-identically in 3 files \u2014 src/hooks/caveman-activate.js, src/hooks/caveman-mode-tracker.js, src/plugins/opencode/plugin.js. 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/hooks/caveman-activate.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c93de53a77f76407a37c9db8a3cb925f06b8c8e2680b470a0804e40c73bf6d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CLAUDE_CONFIG_DIR || path.join(os.homedir(), \u0027.claude\u0027)\u0060 appears character-identically in 4 files \u2014 installer/install.js, src/hooks/caveman-activate.js, src/hooks/caveman-mode-tracker.js, src/hooks/caveman-stats.js. 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":"installer/install.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b924bf5d51fd98a4792be4172cbd077d9ed376899ffc329145185bdf94a851a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0022darwin\u0022 \u0026\u0026 !process.env.CAVE_NO_KEYCHAIN\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/modules/provider-logins.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":21345}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d0337edcc4c7ff96f2edd35573268a39b7a71f13104bedd3ca63ac5aac217b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw[key] === undefined || raw[key] === null\u0060 appears character-identically in 2 files \u2014 supabase/functions/blocks-telemetry/ingest.ts, supabase/functions/cli-telemetry/ingest.ts. 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":"supabase/functions/blocks-telemetry/ingest.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adf0b808868ff5a0010a2e421bbfbd4f9440b698027cb9326d4cf201f9d2f61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolveWindowsCommand(command, env) || command\u0060 appears character-identically in 2 files \u2014 installer/lib/portable-process.js, src/mcp-servers/caveman-shrink/spawn-options.js. 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":"installer/lib/portable-process.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05233ce35c69adcf4ba79872fd65dcf30534b18af9a58eb67b5dbc3d3d975c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.policy_mode !== undefined \u0026\u0026 response.policy_mode !== \u0022record\u0022 \u0026\u0026 response.policy_mode !== \u0022safe\u0022 \u0026\u0026 response.policy_mode !== \u0022max\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17539}}}],"partialFingerprints":{"codehealthFindingId/v1":"298cab23f038558a520ca471c53d1bf2fa1983d8c1cd32a63f991e2de331dada"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows.length \u003E 0 \u0026\u0026 Date.now() \u003E= globalFullUntil\u0060 appears character-identically in 2 files \u2014 supabase/functions/blocks-telemetry/index.ts, supabase/functions/cli-telemetry/index.ts. 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":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c521d96a2496b3af8087dc9659bcff56e26ec134a4e728995bce6066b7e0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isSymbolicLink() || !stat.isDirectory()\u0060 appears character-identically in 3 files \u2014 installer/install.js, installer/lib/openclaw.js, installer/lib/owned-install.js. 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":"installer/install.js"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde177a7976b231e6cef2a9251f63bf7260488f0e96b6e2563150730c761703"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof candidate.bytes === \u0022number\u0022 \u0026\u0026 candidate.bytes \u003E= 0 \u0026\u0026 typeof candidate.sha256 === \u0022string\u0022 \u0026\u0026 /^sha256:[0-9a-f]{6,64}$/i.test(candi\u2026\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17607}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac3cba68d4884cec0bb5b8b694b44a29ba08bc65ea60ddfd0de71fc53eab26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022number\u0022 \u0026\u0026 Number.isFinite(v)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/shared/contracts/scripts/validate.mjs. 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":"packages/cli/src/index.ts"},"region":{"startLine":5811}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3f9c962da9e67b8522e24b769ce619a863c8ec804db32ca38c0d6382456a6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value.trim() === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/agent-mcp.ts, packages/sdk/typescript/src/index.ts. 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":"packages/cli/src/agent-mcp.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a240cbfc070302fb30ade548d7a07990864e5d986551eaf5ace08b7dcd79d33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/sdk/typescript/src/index.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":13716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9afc0bdfd6af7ea8e0474b70bd9e9e9baf1c786c1247452813d350aa0e6e58d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/sdk/typescript/src/index.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":13131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c677f5c6aac9c800b5aa86bd139b779bd18d9a4cf8c9b7e376a69adacd0e8cca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim() !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/native-hook-fast.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":17691}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f53f6371795570a67eae555192205fc2676eca5c9a242fccd045a2f6c93171f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 agents/compile.mjs, packages/cli/src/agent-mcp.ts, packages/cli/src/index.ts, packages/cli/src/modules/apply.ts. 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":"agents/compile.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ae4156a83ea31b34530a14dbda2a0d369d02977e28abf3bc0d1b3cef5da674"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/sdk/typescript/src/index.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":22052}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d1ca3d4115e9f9f5e6f16f6290af9338dedb4d17c971182ef61602643717e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || !Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/index.ts, packages/cli/src/learn-trends.ts. 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":"packages/cli/src/index.ts"},"region":{"startLine":20361}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9e3e41429970c6a7a1a9e9966bde59c68b2dde5030584cc5c32584df5e7b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchor.startswith((\u0022#\u0022, CODE_MARKER_PREFIX)) and first_nonblank_line(candidate_masked) != anchor\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f494f2a4a8ebf2ae7bdafa9666821ba6549f91125206ac7cb7f391d50ac61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt.optimization and attempt.optimization.plan\u0060 appears character-identically in 2 files \u2014 packages/middleware/python/caveman_middleware/asgi.py, packages/middleware/python/caveman_middleware/litellm.py. 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":"packages/middleware/python/caveman_middleware/asgi.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc66696a2922addfd73024b0fcc0ab7a5bc237cc498afb342d66205bb0b2c5b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060close_m and close_m.group(2)[0] == fence_char and len(close_m.group(2)) \u003E= fence_len and close_m.group(3).strip() == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/validate.py, skills/caveman-compress/scripts/validate.py. 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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359a614ca62838205a18e97a760a082f6d5dbe5a2ce65b0fa042964d1907040"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060closer.group(1)[0] != marker[0] or len(closer.group(1)) \u003C len(marker)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad0214a2dceb43f86b8b73fa932ae83c3df1965e9a51cbe1ad12a6834aa74f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compressed_body is None or not compressed_body.strip()\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d54199f59b08fceb6c2b5b45ed8be246358817d6118fedba1b158a2c6fa75e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first \u003C len(lines) and not lines[first].strip()\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2369e3e74dbaa6aea7e371f8c2792904ab6b0239c77bcd7fc125a80223a0bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len(lines) and \u0022--\u003E\u0022 not in lines[i]\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903ed0ba8c6ac08e2e6a82847d6221fe7ce076e5658a2a2eb860e8218cd30a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len(lines) and not NOCOMPRESS_CLOSE_RE.match(lines[i].rstrip(\u0022\\r\\n\u0022))\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa4dffa12df1eb91a959632e62e834a465525e9af4d7cdc35f33d405370e4e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inner and inner.group(1)[0] == marker[0] and len(inner.group(1)) \u003E= len(marker)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d35a27d13a3cfd747f091086bb8fb29a210e3738b484f3fc951cc6e7ac37ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float))\u0060 appears character-identically in 2 files \u2014 packages/sdk/python/caveman_cloud/core.py, shared/provider-catalog/validate_catalog.py. 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":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762c0f48890f5ceae47b74c3148a7d43a276ea325971503aa15dd9516f8a43e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key_value.match(line) or line[0].isspace() or line.startswith(\u0022- \u0022)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49e931067c8ed22ed017532b24300863f087a95a41e9ffe4c29c41bbdca8efc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last \u003E first and not lines[last].strip()\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0105733561b79b13383bf4b1d4c10968430ed2cbc2ccab6a7aaa56311ce935"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line_without_newline.startswith(\u0022 \u0022) or line_without_newline.startswith(\u0022\\t\u0022)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc61d42425622b1408b0dc02bba0061bda6ef4e51a354373da31d92765285652"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lookahead \u003C n and lookahead not in fenced and len(lines[lookahead]) - len(lines[lookahead].lstrip(\u0022 \\t\u0022)) \u003E= 4\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/validate.py, skills/caveman-compress/scripts/validate.py. 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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2555d67fd82fc2d7b59b052e955765dbc1e0b78ff70a562bbd0c766ae3f5101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lookahead \u003C n and not lines[lookahead].strip()\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/validate.py, skills/caveman-compress/scripts/validate.py. 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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f164cd75b9e847c1502c9a68b140f719e248cf1a6fd478c4d1f4ee1e68fe8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060masked_compressed is None or not masked_compressed.strip()\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"446fa7b90145434ddeaea11ef21cee6bada50943ea3ddd02650f9a79293eeab6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.runtime.mode == \u0022off\u0022 or not model.version_supported\u0060 appears character-identically in 2 files \u2014 packages/middleware/python/caveman_middleware/autogen.py, packages/middleware/python/caveman_middleware/strands.py. 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":"packages/middleware/python/caveman_middleware/autogen.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"873f63c861da37f25532ec3f0db4e750ba121934b43c555d73460f90816cb560"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name in PROSE_DOTFILES or name in COMPRESSIBLE_EXTENSIONS\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/detect.py, skills/caveman-compress/scripts/detect.py. 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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"82963d6c72b383565c2653dfeebbf14e54c4f572eb580cd0e3857b4ec18ada7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060non_empty \u003E 0 and code_lines / non_empty \u003E 0.4\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/detect.py, skills/caveman-compress/scripts/detect.py. 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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a244b44d91909b843c3bae9d6ef9b271c83dc490f70bce83bd9d6d801eaf7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060non_empty \u003E 0 and yaml_indicators / non_empty \u003E 0.6\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/detect.py, skills/caveman-compress/scripts/detect.py. 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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"190c6615384297975a05b57a57f8a4f156e82b2fded7c41939498994a74a6eb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not candidate or candidate.startswith(\u0022 \u0022) or candidate.startswith(\u0022\\t\u0022)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58eb5ce24ab2b9bb25f943a8a67f15446bcdf6a594a6e20cb1c4587562589d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not had_backup and not run[\u0022live_write_started\u0022]\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7adbc3e43c340ca30f5c4329e02ace4c37d927393fdeae08945bd47516a8725"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not in_list and previous_blank and indent \u003E= 4\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/validate.py, skills/caveman-compress/scripts/validate.py. 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":"plugins/caveman/skills/caveman-compress/scripts/validate.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7a5bfd91a04695eca3d6e5123b35b17ffd0e771eb6424b3eba7ca6edbe33d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, Mapping) or type(value.get(\u0022handle\u0022)) is not str\u0060 appears character-identically in 2 files \u2014 packages/middleware/python/caveman_middleware/_guard.py, packages/sdk/python/caveman_cloud/middleware/runtime.py. 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":"packages/middleware/python/caveman_middleware/_guard.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f5302fcd9274e6f17a04ca2a53471131a26d504354ecb8dc7b7880ce084839"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not nocompress and FENCE_OPEN_RE.match(line_without_newline)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de04c5b15f6600f39436a2dafbd3b50d4096dded1e24ae8625c94dc88acb61b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not nocompress and not fence and not indented and HTML_COMMENT_OPEN_RE.match(line_without_newline)\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd8e37e3f4fbc54c3d53db58b96755cc14d7f2443755736cc5e5a898d56e7c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not nocompress and not fence and not indented and not comment\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22c41a5458878dc9255d7ca600ad26af1fe6dd1d58583abbe9d9f650e6858a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self._version_supported or self.runtime.mode == \u0022off\u0022\u0060 appears character-identically in 2 files \u2014 packages/middleware/python/caveman_middleware/litellm.py, packages/middleware/python/caveman_middleware/mcp.py. 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":"packages/middleware/python/caveman_middleware/litellm.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bbded79d29066d9d7695f8cdcd9d9f66d6381422cc80cb0a879cd873d0ecd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022OPENCODE_CONFIG_CONTENT\u0022) or \u0022{}\u0022\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e467ac5b3f2f8e36af47ebc9df390975cecf08337521a9a8720d4ec10159bfd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(ENV_COMPRESS_MODEL) or os.environ.get(ENV_FALLBACK_MODEL) or default_model\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc41ae8f24f8d7c02fe560a0d99fb58a713932cb0bcab874a67c20274808793"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(ENV_COMPRESS_PROVIDER) or PROVIDER_CLAUDE\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f9c99b0466748ea6bf74391e42b416b34c3e4fca0299504b51ab80d3c315de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.name == \u0022nt\u0022 or sys.platform == \u0022win32\u0022\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94f89cde692c56a1c7c8d715ad77a5504ee9f451eb665d8ce9f17c98bb9bc64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shutil.which(binary_name) or binary_name\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/compress.py, skills/caveman-compress/scripts/compress.py. 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":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdfe7e97dcf6fd127fe1085963b95b9fd118c538f46126e1d0e7ac5212d1139"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stripped.startswith(\u0022- \u0022) and \u0022:\u0022 in stripped\u0060 appears character-identically in 2 files \u2014 plugins/caveman/skills/caveman-compress/scripts/detect.py, skills/caveman-compress/scripts/detect.py. 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":"plugins/caveman/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b59e02071cdb3281fced8262b949b057e27063ed664eda33990f95f69f3ea1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(value) is int and 0 \u003C= value \u003C= 2**53 - 1\u0060 appears character-identically in 2 files \u2014 packages/middleware/python/caveman_middleware/agno.py, packages/middleware/python/caveman_middleware/pydantic_ai.py. 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":"packages/middleware/python/caveman_middleware/agno.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dff9bafcbee9f0d5328bbac5c9e46900d625a68ea81009f9efbfeaa9495d22"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context or an AbortSignal: Only 39/59 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial) accept a context.Context or an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 (Go: \u0060ctx context.Context\u0060) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"577196fe89725f9b0e6c2faf89eceb8eb245919bd44e4439e0b0d649c1ee1c53"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncPendingLocalScan: \u0060syncPendingLocalScan\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":13503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22ee1afaccf3a85008207060bcd4e2c858097c8820b6744ed0179f857f706fb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncLocalSavings: \u0060syncLocalSavings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":13605}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee0dae302d7591b314f6f7f3a60c121ba3ae9f291a6cc406f63924369795223"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncLocalPracticeFindings: \u0060syncLocalPracticeFindings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":13777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5164582dd6374c041c2d83a51ebe0a4d327bb9c6fa70bef1f15f4b55a2d0ad33"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: auditImport: \u0060auditImport\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":22087}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8de8226efc13b230ba82eab9f21d0698d809a32d546732285815586f1018e62"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: auditEvalImport: \u0060auditEvalImport\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":22112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe2e0b4c34f4d5dec4196faec165a788fd434c0fb9453469522dcdaec5d0feb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: get: \u0060get\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":22879}}}],"partialFingerprints":{"codehealthFindingId/v1":"247611b92a140ddb769ee2095113e8c4538a25544d02e437100a2f58d9fafedc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/dist/index.js"},"region":{"startLine":22894}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d40d84459047d40b16d11492c30a93af96e8ad36ed23b5dc8655ab632e2be1"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: fetchClaudeUsageJSON: \u0060fetchClaudeUsageJSON\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10603b3f512152d63c85e92f7e9d66fffaba7ebae9ab899dbb5e31bb3a3233b"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: call: \u0060call\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/events.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f77259223585e0435d3f7eb29da60dc845dc7991e1e0caa46e4088c18807f45"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: ask: \u0060ask\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc0e120dced526b816ef8a619ce243ea188f8da023937fb4c34cca1978a912"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: warmCall: \u0060warmCall\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/warm.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdd59c6f130cacfc7c493160bd9291b2530f3bddc84ae44f58a19c69def89f3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: call: \u0060call\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/contracts/conformance/run.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2716c1bed100d9a010008099b1c2f62c4466c85a623503a856cf1e71191f3c41"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: latestRelease: \u0060latestRelease\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/scripts/check-latest-in-range.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc439692fdeaa1ea51a40deeccd17da271833299dd7f6bf66cce72ba636f1b96"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncPendingLocalScan: \u0060syncPendingLocalScan\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7480a33f4f260f61697d9bb4129acaa6663a7133a3d505b21330fe86c5d6b23"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncLocalSavings: \u0060syncLocalSavings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13525}}}],"partialFingerprints":{"codehealthFindingId/v1":"218745b30bf203cd4bdc65dfc81c657694103a906b3dabee73c5cb9f20e2c413"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: syncLocalPracticeFindings: \u0060syncLocalPracticeFindings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72ea9bf49ad3ef7fdc73a88e317303e628489e3e3f1e22276533544d8e77e9c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: auditImport: \u0060auditImport\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21914}}}],"partialFingerprints":{"codehealthFindingId/v1":"40018c03918a12ff9a474528e63a703354b54259609a24b0f577a2b62ed457c5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: auditEvalImport: \u0060auditEvalImport\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21938}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1c055accf7bc7fe589fd2d8e0c49d1f75025eb0612f597b8f280b9471d07f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: get: \u0060get\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22659}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19cf708a78972c7957ed59683a0367e3e724acd11da308b2e6a6cdf37fad8cf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7222fa8e37fe8cb4e032fe17e8b5e03483f64c55404065ee2e2ceb1ae63e656b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/cli-telemetry/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca7b21aaa6fd2f6945d4686e2306937b59a78db84702d2a0e692c0a098f8c5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/blocks-telemetry/index.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c80ac7fdbc8dfc7653648a8c01dde316c179b45a00aedb2ac677caed7a6a0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/caveman-init.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"664a559f01fcf6318b5507ebe577f029eb2ddd628028e19da0848608d9a52276"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/caveman-init.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"057c43a2ecd0e0cd645f27db042b09ba3bad6e40c7c47821fb0234ba0e0c1f84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/caveman-init.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d52ae2830e98e8f5ef995722b135c5ce0f9010658e7afea4e1c031cbf5efe0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/opencode/server.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c51a41cb8dc87880c62bde480559706b88c770e0ccf6989f242de003479ff73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8b5bd071e8a5feac33ed3536e4b35c40771596b31408f78d6672263007799"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8926fb619af913f82542a9ebee0b106751e2e8ed3c6c2e5555c212b33c2b143"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0ea252299c3ad5d849350e0731b6d9e3895afb2d61f0ec5789fe2d70c475b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/cavecrew-model-overrides.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5199c3172fa17ccc9ccba6f3f7ea761154314d8dc1ef2a43596486e1fba4cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c908a79443d91f5f98358343cbc277c9aec160d55912c7635495b2919ac59"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"687e4e0f7104467f53edbcdba765ad1c71360cffe12f3728162c095cbb40e878"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"42467a27a0eb745712f7764803bc67ec7378192d49cc1e9a0bb9fc3c1f238606"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e8f5dd90e05230aace129c9501058694e3b189a7e645dcb975512ab3c5ad13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"28db43f9900a264332f1941e3e827e487d645a19c8f63ddfebde4c29eeabbe4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21509c15da4a76050f19e71de4422112c0c641fefb01cb2a17f1e7366114c41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac55e5a252ec8f4e3680b3e67f9a7223f61c1d56e9b066bf557a0749dd2293c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e613e5f4c07bd1a1926245157b6ea72cdbaeed44e0d738cafa6731e242706b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-activate.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"790349fe3d933fa01d038f346ebc97de5eb832278b3608fac2ee38fa43d9ec0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a2d62e772e34b6bf5bf74d6dc422a4eebca542b7b473cab454ce6a7f0a6225"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a69cfbad65cbdd2d3ef8bbb6e8817d18a0c6d9bbb2ab6ca661bcedaf0cd5eed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b388bea8be4b64ff8abda93c09cb09a06c975ff0dc2e4b2bf0af4ba011ec2f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb81c61fdad63d39fb91e8a6cc1729fc67dff7f83e96021be63d1254389dda8b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f894afebb4911704eb003c38563b4d679317d4d9fa10bfdfb916f9367be72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9e2c8aa0f39f5fc22bf53961d8c30c4573601c4e062d87be2c984de05d30b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8de6da837232297fdd7959b27dc17dd8604e6664145f3b37c20153e7a80f3e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed668a634c4e411264f2456a5e8ce11386a9c5b659d5327f32a34a1fbe84c3b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e172be4efc06883997f6edd9281890a8b40e6f65b30f0c619d05d846885442d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e1597881a22a49add91552d7c500edf66cf971067c134b96e0ef988b603523"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a5447b5dfca881d585f7c6849496a1367067e96ec82a4f4f1fbfee14883cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0ada36ca1c721557e21568c64ab15e8698efc8efa426ea3056c3172b23f28c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0818c98de11f0c0dc2a800d5a119c7f262e0a9f8ebe88316c79211150f1de5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ca699204e815cc38dae1418a043b81d9a03f19f64ff12b29ebd882bdbaef91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d7bbaff1acda21624525e1a9284a45c54b94784e256e07bf1b6baa17b3325e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a383ec099bd9f1c373e4b4dd465b5e1ec101b33ce7f4a4b055d71b25ac6f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-host-session-start.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a03dedcb4ca4e47788118d1cdb90c5a985593abcc69343895d57d27462eec86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-host-session-start.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9545c498f04633917335697a2e37ce5c7954e0585c300cc22446a05374fdb3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-host-session-start.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd00002442d40eaa9f16a6358f6242c8cf0796bb2ebab1e8b49b77533c678e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-host-session-start.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b9feabbe0ec5b20c1fa935e8cdabc56e8404b8e3f9f197ab1c05b9caac8abc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-host-session-start.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"32122463f3f1cdc24dc65fa33eba0a7644db25700727033c5e7374f2467cf1cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa36f4cd1b32496cdfecde53ca369169f3d5c0cf872e55caa73082183d331fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8efc910c3e743aa555ecc54c238365362f63dced3d8655e940ce0232b0c3f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f817f6719cfc5a6caa588c41a8d8822cfe56fff4d42dabceb8648ad050276d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-mode-tracker.js"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c447b7bd7b5d21ba30b17ad7144ab80c587e47d429c029f979819bbd64a99954"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"011e0aa982200910dd151fce18ab8edc13b6d96bc1bb886629cfd9ce25b9d8a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9fe1fbbe8594796fbcd2c5cbea833f6dc14a310d1bf83cab0fba31eb6e7b68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400cb6d5a38b21b62f27e17997d417f47f1f0d71ad1133d44f9db6d5e308a10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dbf13abf022cf8e04446c011a1dca01cdbaa0383953a16d957bd0e50d8a026"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee5ed396c6fe7c5924df6cb2da70f003571f5c320f597409bfbda3c97046d0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"058fd14896684a7df439456b1ea0a3c17983ef5c5374a4e8c58b0dc486927877"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c07db77500921aafd5db0300470c9f9d8ca84374073fba6cba9d8d4db50e6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"88424233080365132a5bc190eee220157d233ebfbd6d9271131b9224f0dbe4c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203907723cdc4d01a6fd2957b1f5c3d0399d5acdc04676d58f85870111e6efe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a029100b84e94d0f69dd714e9d5dd1aa22009010fe122ab9d0b24e9f447b07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1de976eda2101e0452f247278287208ac876a89d6cd28f0b4ed43b7ae61ca5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aafd850e345635dfb9dab2164d15351e96d212c8c4d0f3fbd291f674dfe37a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea369420e8f3170069e3de72cf4149d686bf436fc91b3e6025cd93f298dd5cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd41a1d6c7152581bf0a7cf389658959fe8be93d5bf4c7ed72dc0210f320367"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-stats.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd0b12aa70cf691c90760c7a48e1648aacfb88b692d8066c6f39c9168bb1296"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/caveman-compress/scripts/cli.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a5fc2860e7c03549c0b03b9eea85d919b3f0918ae4b7f6659269ebd8b71b73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/caveman-compress/scripts/compress.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"555570d67b1a9d96926912c26b4a31fa62e316a84cff2d8a1850348ad7a355c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/env/env.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b51021861fa65febfee6707ec473f8cc9f4d7dfe73aebc43720b26a176981b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/env/env.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dba4e982d5a8ea13a9fe5ddc03146b9b14590d9103199bf87c024a437e3c9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := xml.Unmarshal(body, \u0026parsed); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"589c92661a7357d75b4317c0895547b47cefcfca9eadafac9d4eb2ee30446067"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f24a17b213d5fc6ca3c1ca3fdef6e4755f58c656d70e38b53a982d3de61ee2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7c748d46e5e0116c0cea06770504b902e6907e14a4f8a50095a779e88737da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac226318062d5c58b3539bcfbd1b05b8b9fc247ac5a6d62652f0769f79815d72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"361512bb68f1d5d4966c177c96d9d4f1453b4d6a2239a3b36c4346d0c4bde15a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d672625a49d1594a2168d71da52c88e85461d032a0f251542ba7acc2f4b25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2bb0848c1b85ae95fdc4047cbf28a181c6c612b53aa71f126fb8987b734c87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72de53cebb734f2e50f2c91df69cc8377681845ef8c0de3eb1347276e02e1fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72967b6d6706b1ee5853087d8089814d58fffb981dca4ea54369c38ea6e564b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.ParseFloat(string(data[start:i]), 64); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/inspect.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"538772d36fe797c8d4cc36529c34ada6c176f5a298372d69b1428d7b1cbc0a2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := validateCompatPath(path, \u0022\u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openaicompat/openaicompat.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b177c4b7592af481813260d3070af76f242b5230949dfbe59b7e507838c87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := validateCompatPath(path, \u0022\u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openaicompat/openaicompat.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e83153249bd22f11bbd7ddbbcec8195134e69ba71f182d9de53c93b117b1cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := validateCompatPath(path, \u0022\u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openaicompat/openaicompat.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c0bf96fad819307d65ab4db77072879a04e3bdfc5e74f26d39b90521c79e10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := validateCompatPath(path, \u0022\u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openaicompat/openaicompat.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c031b1e591290dfc98395dd6500a8da6ea54139e770c57637b17c52a7493f91a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/cache_key.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05a775dd029f12d5bf5113734c71d3c6f4852439dbd28e69ed738d520a8543f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/cache_key.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2418412c9ce120f2ca5d7ed7ba90168aa96e378fe1ae4f4ecc9f3e115920b33"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/cache_key.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a60dcc73a5fb083325b5c46ee2c2c918043b1cd8bf88040d6213652fba043de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(original, \u0026fields); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/count_tokens.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cca67009e97d1c64f6ad32b516e52b2563c07aee8ff39e951fa67d2cb23cc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/count_tokens.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3d479aead2d825e583fafcb0306c2fb0e6966371e7a9b19aa5df382bb5e280"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026text); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/count_tokens.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dca89187f8930f99f29439421a5e9194d90968dc3a3569eab274253c55961b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(text.Format, \u0026format); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/count_tokens.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f267527879f609f9ed2461f875497a2afeaeb638830f8f680c8abbb9645cdc28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/openai/session_cache_key.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07e9c0957aa3e21b2131f4f27c51238beb76b56dac80804922575b80e37b129"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f16bccc944597a858a80366b20b134ee000ca098dc351b0cf6eb132161162"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"21609971046c6fd299f96d99126a772b0a11917f40ccf010f2e64607279988a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"942c02929db1f8d747ef28fcc81d4e9214c155f342131732c6a66a5a9efe6f9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eabd266cea871318df72110d14ef738ef7c6b9be5cb1771caa62f4507f8bce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa411112182e89a832b061a56bfb9600fa5e55c66d9261710ace89d96179ced"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := decoder.Decode(\u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc19a4d212238d5625f134dac0b930a49ffdc1b49a3ef6d518724bd84e9332"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/internal/counttokens/counttokens.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f61fc3770c6965d41ff264fa33ea8ca3b3c05429974a7d5d1ccd5bc4323bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8051202ba01bc8e59050701bae57f0f8849abf31d3df268037442979585504d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"355037a6cad0b89074d120eb4f25d6fa29676595669a754e2d384a561974be2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/bedrock/usage.go"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"61405e23f25cb0ebaa70368880603c2d0a82b00b2ba61088c97075155e6d54fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/messages_stream.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346c5978dd86290723cf8d4c5b71b7947c52e7f6b5e74e1643cbed69f698a98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698bc698c24f624aae0ab9cffa9227b33589543667df674008c5a800e7e96b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses_in.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1a1623a11d6c2172cea32c9377b01f9141bb6b63b587cc15f0405bc9338018"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca77d9d896554b3342cfd99884a9c9318f93d665a5fbee1a982679c8291f7ae1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9a98927f01b8b6cfda344404e2d24428d7838387a77ddf78398851abcdc6cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6324d0d7467a5b1752086b9e091b0539114e9983a9a953184237231e3f842e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dc0b9a9d1b9b5bf7fecf5cd19d46d6e3504d64be3e5640022731f84b2e91bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e651df34666e2a269ec98035e6f5abf8d13bdb21787517228c7183d28bb999"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be3d6d4d25e07f3f458728fbc423e109849c9c8b99b43c03fb968f133824218"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6014c179efbc9339f39a1f9461bb18eb47a2e551f40bb49867dc0415e0bd669a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af13a69c93310cd9d91f3ddbff561164ebe119bd526e7e298fe6c5d191927e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b29a0f9f3d334367860326fcd928a6094058f241b89a68477ca5ca52bf6936"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd97dafe9d02802d89af3c0d8578905d2915a49a98e23f4241e6ae42afae42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0049124c88a2e821abd1c52ed5c70a283d530e6d64463bc66ec75262f4a1ee3e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5faa09b49ce4fdc55a93bf007685e0d47ccd2436c965dc875930ec9707eb28d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e3b74a00aab862eb3d59b12cfaa9e19bac85d48cf9a5493bef1791776793b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_config_trend.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3264e68d3748cafba1fe88759251958be4993644dafc59afc67a29506a3feeb6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_memory_health.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c3726f8e2e43431facbfc7bf7c3e0e3821d0b063d8c64c18b8c8296e2ed805"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := exec.LookPath(\u0022 \u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_outcomes.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2522ca8c054e68e3243e1a4744694391071049dd8295c1d0566d26124b744c5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_outcomes.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e67c449b2c1aba97b27e2aa33dc448527ce18a8746185070ce1daa429c99ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_attribution.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7403c07489910d54a1880fcfc70f02dc7ff9535efb81d9438aea9a9018b1c9ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_attribution.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c174ab46d4b0807aff680b7325ee1493cfe960fb15964885c47bd088fab1f4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_experiment.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb2754ad2c95b9d9a96934185113602026ab223a83f0210bb0950c4600c886c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_loops.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"797298c888516bf3e5782384b04ca91d3e94c32551efc114930a7d9a0dd35054"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956e6ed07ff3d2ca02225b5ab1b79432c334cfc22ea0d26d9724ee12fd1407c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca983c3f6839257e75a7aa42ef9a7c248a6db7fe620b8c44cc46a98909a5e209"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := time.Parse(time.RFC3339, record.AppliedAt); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e9341d80daf82cab4484f4c40e49f72f8839a5bd668e9c658f084b8714b255"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37ac0dcd8f7a7a33997d00960fae5987cd162c36ca8760774f468c9f33a9425"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee35dc9a05a99d85c05d97a3d6484e9a97e224609db130dca9d8c18bc1ffd5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_outcomes.go"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee273ae657fb6e7fb979cb245f18cdc6be3c6fca00a6b5cd0656df0fb98a10b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5deaf4777934283377d407d6a809581d67e41e6b5ffcdbe2990e12fcb82c9fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a794e6b85d1901072eec369c74330280da81d4538387e7303c311fc275a780"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fbfaf6b4220fb63b52f468df7a6c5b9db31224a96ee90c2f91befc2bbe7a18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_retro.go"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c60bf4d33869c839208c2f0c730ba29ac0a24524f1c9445aa1ca92ad02443c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_trends.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe4b6161eeea7ced948b532c8c58366072ce2f7d581e4d5a572beeaae4ff869"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := trendsTemplate.Execute(\u0026buf, t); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_trends.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aab9adfdbdc1c499918e73125ba9e12c2aecc5a216be90e2454b41d6250bbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_aider.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab9f163a346986f9b9221ea24738b5f4b86cc6bbf5777e4de6dc9a673e11652"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_aider.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda642b4806b64ce58241468e11f724d5cf296ad3cf523bca3055355d3c49cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_aider.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7670711900423018c2cd2d6c14a4d1fb1701b9cc5275d2553dc8e01eb8f70c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_claude.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"422c7ae66c1b49debea44bac02c79f9004fef93af165c3c839eaa80836d811be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_codex.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"401cd885343e81bc842339be2219fc342b0d5d8c9f71ee3307f65768d2eaf8ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if relErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_gemini.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf57ce1acce81c90d0c0566fc6523aa933217597837496d2192c9675a62fc18f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_gemini.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016f28c1f0dfb9a5a8282af16747a3df3a29de8b1d7ab8bda6b432716a6bc5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if relErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab21188fae71f168d2fd81c3982664792f4c72f231f4d7a5e2d4ebe539c21f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5452ab3c07fe94676445405fbf6ec9db954f208e0525db5044df0ca9b0312c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f75b5cab80a3d84bb3d08f0388d7179ee425d26ea76354a3a27338ef15dcb56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e64cafba81df46bcf5055f1434cebf55c49604718ec1965f7876db5c612f22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d57e759c888b1cb9622ad0c650c5eea3909682a18c48d491cc0b07dba0c478"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_opencode.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d6fd5d1ca0ce81c7d04f63291595f2823ce63ee8f73efa9e3bd8839e86c908"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/source_pi.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39dc7f9fe5c4dd26ad90b498c147a151769b04d85659f916ba7b26d2e44a93c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd117068451a99c04ead7024b94b1a8b5bcdd08d170afcad9f3dfcb294ee051"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := reassemble(replacements); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/trial_store.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d099724b9bfe4c85f75d15102747f8b5129271df9100d503dbf1dff34a3a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e2f483d850ecbb2fe930aa6c9dedf31aa3c8b9cd3fc23af3213c68583d6ca9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(sc.Bytes(), \u0026obj); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cd2ed015255b8a0d1a06b604b7c38409bee06a7c294ba9bcedf75f03758c02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(sc.Bytes(), \u0026obj); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d72b650d9b5e45aba4851cd017235847ec17afb443b9fffe7e2b0a6688aaad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"949e89e51e060cd501028a667f5d92213ae7e2558f3146cc0239aff60a654f7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50db113ee7fb80f57cf8d5f01e4057e5a77aab16200369824ecce2899f0fc36"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6fabbf01e2d100a90ad4fffd26934ea7d63a8d5b7f6d5c30f0fedac5021f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"886a0019a1ad03b13f183f094ba73ee61a638a7befa36546458197c805f5ae0c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/runstate/runstate.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfed859fb56708c80e7097f52dbb9176d4ed7fb2b19ae761e84962f18dacad2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/runstate/runstate.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f42d6e847e0bed28b247651a10c258da8c7b75ea86c39f2cb1cf5dd8eb1f57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/runstate/runstate.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"856c674eee6002ff40795677f0f114c49e7031a335883eef51eddf370d2e423a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if pipeErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c282fdae0615db58f2075217ad2d090cc22e110b3fc75b6df584e4a4f67acd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if startErr := cmd.Start(); startErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"df70d25e0400e74b1b2b0574059593da7ed503f595b65e94cf106ec4a8689f93"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe9395ff10b14086971f6250bf1a3ede581dedf2d466325e591a64faab39dca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/symbols_nocgo.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3906c5c8c03bb01906cc486858d5f981874c1356f3553a3472124f142e7fb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if mapErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c880e61ba34b3dd8e1f995c4e6219f9093f524ef5ae7df2cc5e2d6d69a5d2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if mapErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"460a0a0d6c594abf28155c799c9dff5a4f0e5d741c00e7e3ac038037194b5da3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/runtime.go"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6777ddfbfbaae3bce2e3477ac849171ec9cfeeeb4f14daefcb1d8a91f2d26757"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativeruntime/server_windows.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab43d52af6008857930a7aaac140ebe22d95c34fb432b11d81e66726e38d10fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a72de94d8982db692abded814878b97d7ea20f28ca93f4ec467c4b8a54e8cb9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db87e7d0f8f8ceab2ba4202ea815d44f391f95e4a6d8d36ec07334898f00795"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6e2df3ba15b1efe8b56f8ca29d753bb6096344b7e547c1666b169279d5ce72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4ab915178ed2775b2e74c84ec9cd215cc7da22ebad0f1fc6205ed829d93aef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acb2adfc18ebe9a599cc4ff8b3ff89870556cf168832534655aaa908e96ed26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47503fcf5361154a3c96a28e0f00f77c83f3aee13f50038703c5f8f8c9b8ce1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ea466f06802183760ae7a15a0c14092c216c628cd3b4615fa657fb7f795f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/oidc.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f106bc5ab9189bcdbfbe528b2f0e1dd70450f0ec84e573d21e54e72a9b4d59c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/identity/tls.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"343be9f2237171fad06d4416f50e4968b3eeff88347d5030659c96218a794e81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edda57ff709eeff4b0dbafad6214833964330387e41dd4e62f1740c6753579d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8891443d3200d3b9b9cff5daec2a10500d184780b300e2a8492aa90e9f0caf2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if out, err = jsonsplice.ReplaceRaw(out, span, []byte(\u0022 \u0022)); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3607ca89704cb8ecb88d815c14a2cd11636039bb1fd0e8c9703ec8b373fc3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm_table.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dfb0686b4778d2498bee61b23f5d00871c9031bd0e71c171116656ced19c04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm_table.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce56a63bd51bfd758bdc6f66094636ec56d186848664a19e39678e3377dcea9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm_table.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7736507acc9b196d6373a7a290cbfb27253a1fb903402abbd3697412349634a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.MkdirAll(dir, 0o700); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/capture.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d12952f07ed7f7798c62dc060eb14c97eedc572d6ab4e9466e472b96f6a180d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/capture.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2353d17d6dc8aa667c0a11dd2f1bfc3faae43d720dd02a2e9f2e465beaa3bb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if readErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0380aa28e00d3606057612c79c560719ecd6bfcc77a045873ebee20bb73eeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0d2aa3eb7b67eaf4c61df8dfa015ff397f900f1a614ee7a759a638c47a7541"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da984c067cb1a9589e4619ed452b3ac0d040a355a7b71ffb9789051464c0d66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if doc[\u0022 \u0022], err = json.Marshal(append(models, entry)); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5301754bb8e4a19d5157c659fcbed158711051e2e515bcb44b78606cb5b25cae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d297221eeb2241eabf2046a4817cb0b54f44d4fb6b29551888d3e863aa8bd63"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d190c3381926a1767e28d43d5abdecae9a678795827c613c55d4e55e19895b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_auto.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"322039b01d64142c1e50ff19461d5f75012669e6369e71775c8aee718dabdab4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/chatgpt_encoding.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6f159446951d03ff29701313083e51ca4650764e0345dca484698d95ed8346"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37fa40395dd9a369b1d3691328c788fe977b568dd296378b1758c221794ba7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4aa79d78f34c6b17f49e495b0279329835e7ea0d1160c851939c87a89355af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24361f4f214b311f9b2689b4e1d272d0df88348ed67633886f9d0f2eefeb5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001844f0ab27556a8d3cccf1983546113aa40eceededb6ea02f943a77e85e4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a724a34b13c997fea7c406ee208719797955f9e8adc026ed4f083686febc405"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4995568ed50ac9d80621d810aeeea648faa636aba846441ffc0be781fbec34e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"60108e9aaa15440d35988a251d14dd85a5d1c58681796f70bc33dc5cbed17bca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/stats_accounting.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8aec817ef07f8e181466e1bfd59d3b3ea1a99e13d12e07832a50ff6ceb723c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/config/config.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d6682af62f1f9dca189fd63018f95a0b76d0858b12976a60ffd34f78ca2de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/config/config.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae8bc260a6c885ada6afb9d448e1baa972f8f0ee7c73ab9d41f3731afc81d89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ed0d741d4dd1a3123f1ce57cec1cf30e869f4cc97e41ab15897c2a9597d55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a241df2a157943107e1a1a0b86c365ec73472e1b36c23de54b557c98559927d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/warm.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43b6873546d485cb5b0ba81cdccb2b714bf0af36ae41d88f14907ef5817279f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f8cbb386a3e4e5417cded5a91fc6ee4b08b167c11cc7281833fbd01855e3e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/main.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d5ef9a374ab66c4a341471f793cd159698c91fd54665f0f3019f4cd9a76d3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.MkdirAll(filepath.Dir(marker), 0o700); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d66dd6c889a8a064d045b7a7f54911fc10bed11d0dd5489c469d29a9ca36884"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"595ae4b2e259f61e5658416b9ac695ed47fc94f73b3e382110ca19e6abc5e0c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.WriteFile(tmp, raw, 0o600); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"482e9300be568c28b9976fa9a52d5de7be5b4a9e71d41d9eb7f685c931966ed4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/cmd/caveman-proxy/recovery_store.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8da478d66134ded55e6614f375a4e8c6ff6e65a92fb2ec5a051a439a093e81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/cli.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a86be316a2a51aba2c8f331414faae2d74003fa2630bc98bbee1c26d31bf54d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/caveman/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fba7ca63ea3db56878a1e73d91ade8a3936c43d4fe31835cd0422de59f88db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85325b50c2e42d6df06842f84367db21e048d4b286ac4b6a9c47fffed0472bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8d2c77ca4364137305d6943cf2fa0a96a414d2a3204907a6e44d098b82bfed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f739bf90ceaf38ce8daedd0ab0dc891c57b9806b1b6db717d863528b6f594c19"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6cc957a66ae24da46901fe14024220d46444e7010dd6bf9691044f6f559925"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/run.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f17d0ae5df07068a36b371c36a8cc3384c52168eabca55418614051de1d57d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/subagent-tax/lib/process-tree.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75394af80feb3360b49f7b121569afe455509829ffd502297c37130602df5e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb567364b8bf73f1c13e16c40019d7e39599ec2d936419789b056bb1414fa91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"366cdbf5559167d85126aa4504845cab5151e139a0e3785d897e6d7a3005bc20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd45753fa478b11e30513c8c71b5c7b2b0baf385a607e96db328206a79a92ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"480024963c2a3902e5d0b8496f607b53c3de1a0e4111869dd70b44676970547b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/index.ts"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99e1c6c4d75f1be5d0e8f12463161f05ed7c8f4aa7c7f119b889a5451bbe5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/protocol.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dab3b3387995c40d121b8dafe67f3878e4f9d915696e2605fc9fd05477bf13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c50fd2e35cb1637eab4b026bb26bfa78f7f6e4c9f01a185603ff5646fbb94f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a9ff40c232e4ff3af07e71abcaa1f2adfb2860fc6dc9d3205c6546d91bb6f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9367ae830d53de2a283fa2b5023a3576ae10155c22cf390ade77959950341d20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"824fe56e2deb7cf9dabf3af62e1a518bd7037dbad45d001ca2f092bd21397400"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ce715b21a23fef31ad02690d77e6f06c02e5ed052aa9d33f5d5e6d377dee9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a561b4cced4c7de4c4dad36c8993790e598697b28229a7d4e7dd0a31fee00de3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"be08390f2de04dcb09a9a2525b76a27dd626fc5556bc302ea042bc4475d0018d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d8c0015497d3e3f2157f7f6406a3951e370596502ca70f4f290b113438f86e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47769e9aa6f7976fae155f1ad5f85f6dbf76128fbfe0239c8e73a5739b4c0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"491e7bb9afebc4f05e087df7ef717910b37bb0c4392fa203d43eb8cc6b1ddf18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0522096af5720dfa638850c331fe7beea44dff264cf31ecb46ed99124163c0bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/runtime.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3aa465cf7cec6b6cd1a87353dff88e04872a701e3d6024d63c68bf6ddc907ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/transport.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e40c3ac6dbbb874e70bf9671a1b647335a3fa28c913c8c9b5ba01b04424a67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.then(\u2026, () =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/typescript/src/middleware/transport.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ba1002d1f13382d649462c19dacf40ff1ff1cc1fe3f857db0ae63cd433887"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/core.py"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a42b9cf3de864a03fdb65583d0bb38e2f4b9adb8ff0eab47fb5d732b1add797"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"087adbc9512e4777b2dbca5e0f03b75b1696e914821c3d8bf92cc3d2635df8f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"257bcd3f6b329beb180c6423d1c4b269bcf588069b1e7b7ac5f536adf7778557"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbcc17b04d42c31600e9e37057e5bb042d840d756fa33933eea5a8228506120"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"0874e6d8a94af2d45d2c74ba3e828795d6dfa4f9a716d5f24fda0eabb78ac7ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e02b509d47b39b6552a76be73aa3ba5e920774f1f055df9abf6cb23d3748133"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/python/caveman_cloud/middleware/runtime.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d950b27f941ec976af896dc23bd3c32942d1e1fbf64d463769591c7205e017"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bab88ef55fc308075e5be06e2e2578ca06b2809a280407684719ce153e38df1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/index.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d1a5a0562d29c0b5bdc3c081b33a3f34f71079050b6dda0553a3949e88acd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/lifecycle.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"70364d8bfd135be34ed00a68395084e8c1d5e482435b55df78d4b2fe10c57295"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider-compat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0175a9088676412a93355c8b54f6642178cf3245f408cb4df67bbd1ca324b60f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44e149272eaa063294419bdbfcd6e4eab68eff3d9eceaa9ffa04112ea1cbbc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1362fcc62a3b35f265c5763d83e18db1cbd9c2ab15bdffaa5432e730a20e6b0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/provider.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7344f721370d3a6c0855bd8a8f838df19db080df2c071267811fd20231062d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"68abf3daed62cbc46371dac989e4360863fc1be7532d2d8188e5344bd8b3cd0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc6c82bb971726e75f80906414763031aaeebb057fea00e6141cd397a384ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"64801c6ab51b0dba0dbc937460dd25ef003be16312d32a66e390db209c220eaf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7308145ba716ac76763ef80e49f1af51561c0dd91af3764cc314bf820316d064"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-extension/src/recovery.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7189c3e2b52d32765f31b72dba0210e02ee3aedb9ccac161e73fdeabe2089c7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/common.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e9119e31bc5cf28624a1ba76a2f78dde4977bb680a03215da413b0943d439c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/compatibility.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f726eadc4d045a2ff878548651cda6f0a35af97a9ab480e2d8c0307cedc2f211"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/provider-response.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fa20c66d9c1428cedd11b3557d363a2dfff5e626fa35ea584a497d413e183e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/versions.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a95c296471991dd53161eb832c1699335f97dead52b13e066ad6bec2140bf5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/typescript/src/versions.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f6174b37888acc2e7bb0b42f1d07ee02f625c505f8aa9eaba1426a63eea497"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"545cd6fc098cac2d15d40ba11539b009b938afd112cc9098c767344cb368d1ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/anthropic.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d88d0ddead8b4fd3114a4d0dcdb2734238bc445e28437b56877b5d4550281b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3440c780f3cca7360b904d323076aa5465617dd1412b9ad1cb0217a4438f98a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bd6d0339537162af257414f2214d716bab57bd099bf4fdfc833d4145e33c0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/pydantic_ai.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20601e483261b0447eebe648e72d9b37ede55047ca96cf1a6a4d7e09c815b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef49eebf150888c0e3dde8824866dc8aebda239713cda414d086e68f42006c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"723df20a153205e6feb952dd9b93d3347ab503f0743acaaf5d7183ddd4e9c941"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07a5a61960a663afe27dde62fa6d4a8f3dfdc6effa05df58b73f0a88b3e2548"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa0170b3dbbb07d8eae45e5669b43e095c0c48a2d098119fe4484190c1309f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d889ead6b93272496d41beddaffa7349e13a1368040c4038a1b80f895327756"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c57b930bffe282b02c82ec1e23aba4c07d03e87854c54b0bf7faa85c8500b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"526402ad6bfcf2df05bae62beaade2ac4dc7e501551d8ca01f84f7b3df9df65e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763f1d69172e40765cefcfb379d33b0054d3365da6e027707601e57a2a2c16f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2499c87e705e21040ad85b7e0ea8f1f4a22cf6d8ccbb48a75313bea9270de25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a97c9c18208cf1480698d7f0c3c8789113cadec0e7a577689e8c7556f588c14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7619ddd9c89609a1ee83fd8b8f9b1eb3ce54eede9c82fa5d86feccb18f23f91e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97162e4e5db33aed50ac5ba6ff9cffb06faf0e2f0e7db9f4c7366b7f975a54d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a547e2a0446e0f40e9f99b3c92d085a104e252caa759e1a6e2c00bf18255388"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5dca96e98368c6c40712fdb4f7a332eef1e0f0a006490803b6677eb290c385"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a80ba3a96d63a359850ba95aac2bdf584eeba68bd93fb07b89bb7e65f5443af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45ae4057a068c44f66b4000f369a5ac1fabc2f2bc257f06574c29d94aa07a61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ef7f298238582fa5226b70d0ff10549e24b7cb2a417aee730b3a6bef9dd049"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"75993756e2980aef76e99565e7ab4e53fbc6dfff4f4e96207234d991029b62cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb265de8ffa16ba07434faecd6c61bdf7c3f9d75bbf5bdab8d01fcc38a20070"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccafdfd758de7f473516665488aee09293b6eeed3dfd3bac4854a4aea4f0492"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1905fbecb6ebbff3fb23f38e1886a9c02ad2aaed7b6d37723baedf65bff7e6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c95418b4eb8384bbc4b365f605780f08d89db21c4a439fe3044e800bce58fe5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1ac80fd7241757aec4002322d3f2853074853b92d7628de452f5b0273c756"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e21960d8e516181d753233b734edd7f22a1bd1b1266366f9dfea02d141c4601"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4085}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d0a5deeb7a8584266bf50265847b83b3031a8e9b41817d71a8b09b1e76cee1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b247658ecdb524d686a151668d34c50e320964274030c9f30819c919fa3a796f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d82a3480c2cb87bc26901ee58259a56c19ff61a623f28f846665f7910bbd439"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95cb773540c4e2e711e202705058c2c4dc56dd432c12d86cb26145c12d9f4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2650a66b6e66d7c5e8c910a54d0aebef923e5c1ba20ffecf40fdeabeb64e2c90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecffa712f40da5904eb25d2aa933dd710da8f9da42e112dc37c95f41a6b9cfab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4632182db66b14cd1d68e26b218461e15c8501aacdee99796142add936299fbf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":6539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ef57a5b3821cf0bf2256622e1755d50b1cffcd565996b54dc4e5607ff70af5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7081}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45620d30bfe7ce3809e2b99adb342b7d32486c990ba68ad3cf2978a456ad151"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f94f40e3648703c95a2a0674764ddd440bcac5ca37a555c6abb8a43e11695eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7241}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bd61568aa4d27555a4ecc1230e1279ade6c5306145a64ca3d8f68a6300967"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7859}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4503ebf3a1cd1040f0e1f6dafb6f7e01dcb268327e26f5d08294198fb03811"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b4bf0d2f467f0d88ee173f47c5db016a4438072686b2481cea3858d9d6aee9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8570}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f92d25f6635e57e453d0c519c9bed6e8967bfd914da22c631433c081a993f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8578}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bd6fb7b50582972ff4293df86a2ab70c0503241a1af2810eb4eec72274eb31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8595}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a85a0b055cb65d1e3be1cbd6c2c22f4090b28d373f3abfe434009ecfe22eef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8599}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a640c36ebc533110c9262fa6568bb40cd7cc11fa97845c1757a853c91343a88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8617}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63379c0c3717da974cfe9ea4b46d7fd93800471c305414165b8ded8c9590e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e50377c1fe27cb7ca2a224338e05183a59f0f34d1eeea458f1087a7e25facff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8633}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc258f585b5875b9146ac60a7ffd995b8845d0378ce71d5d9df8608fa920af3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8672}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c4c949c507f29118512ba7398a0609ecf8008fdc6ad3e3f99a16022ae8b68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8673}}}],"partialFingerprints":{"codehealthFindingId/v1":"591bb2bfe7b41a9255dc6d97c4d12e7fb870fe1c085e1fe141bd2a4023721bfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8772}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a68dbbcf2124f941438793b762cfe65b98ed20cb3a12e298995f61efdee14b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8892}}}],"partialFingerprints":{"codehealthFindingId/v1":"579b504d534d1dfad74a7b55d1b6599b4e0281b068da10e506799e2e2afb2c74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8904}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a0fb87619c9929a69987c024671dd2040667d4ed545931d73e693a9a27b90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9064}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd5a0315f322e9c9bd0cdfd08855fdb86239a569ff7d2ecc1d2ce5905201cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":9732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dd3813d3c2cf9fc5ff3d4f5dbedbc7ffd323e2953585fae41497e7f788c8da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a0d421d5669f2fd2e18eb2280a381c27955adb6bf3d884112dc9817f2d4c83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce03f220f25b12ccc564a7a296f34f30c6f0f84b1c679a516a408c2b01d80c87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1201344db8f175e72202154a19493ad30e7b5fcb5670674787f393d3dd541be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b3d5a4b2ffa86c859a8b6d06a517f213bce37dc900bf6bfe4de4c93dd2a5c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10587}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1837184c380dcdda652f49fe7e2e4b6f29b102d22e4d74485d9103ab6e09b7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10592}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f1e4f45fbcf06c974979e1edc615688ccb18fdc30fa27709ebb1809ad8373"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10599}}}],"partialFingerprints":{"codehealthFindingId/v1":"88282c4fc41a876d6201aa4baa4851687696a6c479d8176726bbe1b2b2ed1767"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c78df5dd1920dd8e5d202763598079e00aec51e5f7b30718cf537fe51a5995c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10655}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6e1de85e7541d6df177bd336b516e30400fafad40ec4a0e488cdaa75ffd330"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52f3866b570923796cbb529867c78680f84a27241882069f4030e0abf5c2daf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10766}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d43fb8cc9558dd0051decbc4724a05c0c30f76f86d1a295fcc3a5ce6c3afeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":10824}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ff590110a0341c362568fea9e4f7f99158cd5d6b1a00e2cc5b4303aff9fe65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11477}}}],"partialFingerprints":{"codehealthFindingId/v1":"732080228edd960acc69d2c32d9c3c7f13e7b3307dd97d2198b47581211c9b99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7175b6b8c8cca7d202320f31808392c49b8bd4606b173a921134af342c35aced"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11496}}}],"partialFingerprints":{"codehealthFindingId/v1":"543fe42d0f4179b76ce999852615dd291e9ffa1f5d5464657771fe6bdf11ae13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d69847f931a47d7815fd7227b1285b87113716a58128c96de5ff995bde68064"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b34ca262cb5e29c14e1a4205b381a188712e040c6191556c049f68cda3349aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b0ae86acbaf484b8197aa72d2ddbe6741f41b735bb75feb9e1c2f1280c260a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13296}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0947af5a11fd973dca1315c1858359c35f38f8f36b64bb843cb1dc6ad9b5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13317}}}],"partialFingerprints":{"codehealthFindingId/v1":"514f041e713e41a645f1b249498c3fc0b4a2ef4fa1bdb6e8279d4dd65ca46b6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc0c5c4dfdb892ae3b59cdb556fd6ced51839ac117b860c833791f657a17326"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13394}}}],"partialFingerprints":{"codehealthFindingId/v1":"36be1f2e1b79d0a8c1f142885c676aa6a32ee048eda293f2967acfb6ede3f646"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b20d9f584a12cccda03bba3013d632cc715576203f1ae856fef3d9e9a219a4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05f393ac91eff70591f14d075bffbff576c0ed813c775e7760e8a20105656b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13903}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4cba347ec88158bb4ea186cb3e10014b70b55b256526fc1b32020633c13fba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13957}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0742cbcdaffb7304e68e94581e06cc5078bf803c55e57638ac7ae70fd58582"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":14794}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e68b8f495f5373099618797245f0b81980abbf51dcbd107d88b1a4c560b9c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":15499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ef18243139cee9c3d5d5dbf2ce2e4e733e8b22d1c3fb4edef9d6eaf79f6b20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16920}}}],"partialFingerprints":{"codehealthFindingId/v1":"404964a2af263af95a21afd736783b915f7014c0d20d7f29b63c5157634ea88e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16937}}}],"partialFingerprints":{"codehealthFindingId/v1":"429976cb70190a46ced611de1f532fa83bccee7f902949ab3e3782a667e56791"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":16951}}}],"partialFingerprints":{"codehealthFindingId/v1":"a877d8f0d6fc1b816608c843d0e6aa0ee5d2e5befe32db1b0408b92c9b15eb44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17083}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef10804a558d87800157b139c94ff2173e8d1f9dc31f2a8bd2b088d4574674"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17293}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdf81c81fbe99ec13f4350bda8848fac0512f5ed5c922060c85847dc306310f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17382}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c87054c72b2cc92e1cbf095b3361bdf2a9ad5b980bce796a7e853868647759"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17728}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcd9a8985dbfc8877d3db11945bae36f2fffe2593e21271eb6b161ab5a13b4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17889}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4cd8a92d1afa07a3e2b7605f617f2b91f93b73972ae1c6c2a6eb98d6a4141a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c09a786fda55bd90eb5a55d217bd7b1571abf6e1b12d282956aaa1a3ddd0f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18111}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aa29ea086ad0f2797e25c960eb5ca40879807b6b15db6e3306756fb9442bdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb964f53fecee077ea625591f414df43ba76adc620635a43a6fd753578a76ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":18540}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f290894dd8f25709bb9007c513daeb446bd5e2c3d6c9527f23a75846e430f66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d703e0f08cb6ffbcbe6338b09e99006c1b0aa659c930ed72284216c3d7c8657"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c926c7e10f390f8b01b262f54aa8c2f9d553d0d6609095382a605d708711c0d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8172072b1faccf385a9f2f6b6ee02f835f9ff11e97361348d7b7adb0dd5b03d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19462}}}],"partialFingerprints":{"codehealthFindingId/v1":"27082fc6faf7ee6637c9ef26caa062280c42034fd8e0028e380354d7eb14fb52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebbedc8cd3828b20dde2472b08e07b1126c1e9afd8d9e2562147d92e8e53fda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9a91e5d282c0235c79cbe55f2a9eb85d4675ab2d8151bab45870f4cd08b52f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf116190bf544124a0fc52c9443d7e765357f2f1e1376400567ea325d39ed047"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc60191937f3e45d24649486b806ade930b5d9d034f02e8ee827ea40e8717680"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21309}}}],"partialFingerprints":{"codehealthFindingId/v1":"96be64846b7ab200001d35937dedaa37c197f9e273360e8318c8d3fbc863760e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed437f429d5c293021444e8f4ba91920e867410f16c11cf6d6625b4b6aca77d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21421}}}],"partialFingerprints":{"codehealthFindingId/v1":"452423043d6a96df22f50a9c1f46525c85e161d36b1f7081e13d0b659e6d6f2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1112f499e40a31b9e4e674e39f4c2a436e94ac39ca51aecc65d9aab0ab23505"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0803249c573955ca3262d7cdc64d73795ed42f4ddad6f0e02994e7ec640c5fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22917}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c75f964adfb989a09cd7aea45d5f1b6b2f531ee640e2d1cf6bdab1942a75918"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a618421f8eabea48c037ed8a14fd47d41312111206a4e561a9f2be8b9d0b47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02fdc506172e59d4905b6714c31c108a7db43f4658f6db27eb5f42d8579e7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5561eb0e9695ff6d7b87a3278d5f457dec3777c9ede656a07d4f6d323bfbcd94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6bd389b7e72a44e0dad3dacffd86626c17a59e0fd423c9a069aa21dfa8a718"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b7e76c1e8b851a409f4a7ed6163596bc19344077b470daab7a1bb9670d03f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01751ab3aacd1bc86ee11a58f6c8e0558d726c4ce309a1066f541391c85292"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3faf896441cb55d67d5d208c42acfed83db135b730b29760c2f66928d3af219"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"870df9026c9a81a35b4c35994bebfffa2be7d95929084a4278cc4c58cb8ef634"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5276a66d96c1ff3ed58fe59fb4cb045d44480502364c58e16215bac60d0b1aa4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea61d89f8d6de0ea188ab861a2e045a7614fe3b1c009e991148d8a5178e22092"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/learn-autopilot.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a990c88271162a9f231ffedfc2208bfef6bd54f15b772812afb64725f8fc2dad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c911b822ef982d6c0bbb6fced8d549a61f378c186178c36190ff41c3567c32"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd4bb58928392538dbf611724cfd70e0d1036e172f218d9cf29c6b7a647d5b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c7c5501e43a3eaeb54a43d657aa0d7ef7901717b26a9857a15db7390aa210"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431bc234cb5451bec8090d4c824cc5495383151bdde9062beb9d468e96f0d63"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfc14fe9d0535e8c0a5d3a6715bc0f3ee9be175dc5157f6d044d6c47771385b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7c37555c646038130526b24c7543532c3022914586c019de277e49c1f35ef4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/native-hook-fast.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdf2fef47ebf0394511e4b74bf701ef58afe1aecd788bfc11a98e1e0f65dce1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/apply.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38b21453c4fb23dc753f26fbefad828426b33d647dff6587bb9040caa5c61b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/config-home.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2b1c7fb7d2381d6719940e7faaf2301fcba5d2dc8d1a0e42d0aa9977017c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/config-home.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d60a440a25aa395c4cdf2db14f0f590876da6cbcd4dfe7b61ed62a4419819a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/index-file.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f164ea55f0be9f6acdad74c135a8cd5d194686764e5e3be71262e796e9bb1fbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbc4bc4718b7be26dca42568b83d82c1863417dd8900257a82db1e677e4a781"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfdc7da5bf8afa38c09e158a17bc951cae6ef1b325636c721352c17bc680d50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/provider-logins.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa2ff5241e2f0017f2895e66ec96342573943311a2bc41056408b949f038526"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/stop.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb040b4f28a84ab898281030dbc3acb0e1d3c0e7822235472fba09f9a8375a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/scripts/benchmark-native-hooks.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4eaa67275c47bf03e3a980e39ed508313598e4b0aaf3341674da629a82da7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/scripts/gen-wedge-installer.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f90a40a1649e530f11a72167a0a4045ce53c5623c1a1981244c451742871a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mem/py/cavemem.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e06b18b7b0fe9b120233607b9479121ba9261e85d3f26487b86d2df8280923"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/cmd/caveman-mcp/main.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e1047b35d36db0aba5ee5debe5d43f38fbe89037b8b1c473187f54b0fb894f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8692fb433e5dd44e0963775f093626c79ada8f7943fe5cc934230670213c39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea46699ba2dfd6584267791e952252cf1ea993d0ba19703ec5aa76e877022b7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be42ba03df80902dc5fccfc68512498eff7e548d7fe74df961482ac1fe812af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc38e5b364fd15527eec977376b00874bbc39951bd1d45b1fb8a685e394cb690"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c2f68ca21688349e9705c2d26112f54df245c7d01ceb4139f8d2145fc3148"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1606ef7bd40cda9d25a3114e58f5158de598c73b29c5a4b5424d7225936eecb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbc32720f45b194efb2f14f0bbb12018eedc4fdc3963712b92691bb014d23f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb9a79a8cb460d1f8267af0fbb7e2715db60a3c4b7fd54d273cf1038b2bb8ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ddcd1fc0981531c8bb5182a25fa95b1465656d8e3a084f0417e9e8a6003915"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"df41f8a58c1813d588b9ca8e606c2b92b4efce0065260a09e6a898c33b1b9d7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb66ec1ebea45bc082fd004d4a2a2da347f70efa4bd5472b7abaea3c646de0b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ea8b4e3936cdb9504cf2a0a58d687948834c69bd10beae7f3cbb8990c5e64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90adc6213768d152a7af04f3055d413b78f8fd8adf8ba03697047e4c4fd74f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cf7abd5f2953b8e0c3ba0eb1b4ec95e4beeb138a6ebd67cc10c46289307327"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9edeeb77542685c412734d203b011e47f93707685c2dc3270609b909b38eb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ab4e182e05825cd587f24eebe4b8436d1635b28dd7a03ba867f0c9f8ba8ba5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3a4cbf06f0df7ab5342eedf10edde26708bc6a8b37ea2e0a008ad3f420a2ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e20c138f4d27db4c1f762c7b332beada3a07d87c9c7e3873b1b5e4fc226c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59e485eac3837b70c64dd2d7df24b382070a84fbba7b02839d7f6d370179bf5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba8eabee207a3cf77b4422f2a853be605ce840bcfc451934d909475027ca1d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f7264fd11778c26012d6209e2fd6d4c09d1c1b811f29465a41979162437479"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9d34e831cb93b3272639a27dc73e52a4f18a6b59157fcb9b1acd62f35e5f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eee3afb3f43584b413480b6ef08ce8ff54c41bdc8c6b11ec1382e6d94c4342"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"07512f247df6ddc2ad87a83687b8fb4d19c963a6cee0458808df33db5d62cf68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6f81ee7d64c0191d5166001c248368dd23c2315fc529b3e2704fbd2f318c41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a02de1da01e595638ff53ff1b3010d94f0eb39a61daa027a9a65a8780d32d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb46380df826c366b0b2e760a8c4ade57b4f278bea04d69c32018659d7d5ac7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e74a95f6b408d36706cc283ea61cd28e4ae85c898592568055d0466e3b2ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a035c79f11b0634159a4e886673f70554a2e67a1df67365da6f97d9b8069a54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69caeabc68711880655ca9efb11f687517582063d2a9712a5922b7be02e553e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c78e013d7385697bb7c73b0262a2457ac08777d65974baa7f51bba26b7db7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a6694863d8839644e2615781641228146de719a7d52d1b645e388fe2f412d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1f9e6052671b70478106177ff1c7d32a1e745de94aad4974364cbe8d564c2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be64f78923898295e40e3f448d2cfa3251812161000e039c72445ff2b8790c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae75a7edb4d7ce7bd51ec6f1a9e8aba4c62f964eadc54fe191a12599e8a993"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/owned-install.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce1758fed3def01ce74da642b49d1f8293fd3dac00ac033668785947c5bcc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/portable-process.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcade4914151584c4ed73fe80105edefc27e2fb61091bf24e630551614429b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"41535642bd2fcff6a815d44b039b91370ae90a73bf5eb7b39494ad05a3d5657b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48eee0139c2504658bc433628fbaa8af6445a8614826cb2e96b4958fbfadd99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f3e82ed60371ddb9923bbdb078161f29b231192413209a342dbd3f2d9e3dd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2f4dcf97edce4e95ae65fe377f944b9b2f75f51c132c8ea0b1c7aa286a4b0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d3fb507dd2f19ce7064ec496dd1d323662e9c8c6fea83e74e44dded73fd55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/settings.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9172aa1d663a8cab32ab3fd4e2623832b4d5535114dc0d58beb3d7a9880b4692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a545d780dfb853e42cc81e12adeedc8c2656308d80123cc33569b94a0832cc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c2e9aa461fcdb2d19fc72617ccdc41f83dcd4c3e345544963ca0bf72ea2fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/src/caveman.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f0463752693eea0b8990e58c84aab49caa027395565fa8c131b1316ba7edd1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/llm_run.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db61036e8068bd030b9de890c52e3d723de65396922858030aafeb0ef76018"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/llm_run.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"930855f32b531b3fa682fc4e82f6ddd4941aa5afe82a631e19b5fc8d15a5d2a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/measure.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed170b947f17c4f32c7d34a3e4079af8dc20b5ec61a8b0b59326fa93a33f2da7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/plot.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b455c688374c29942891ba148cccb614fafc267aa3758a9d36b8799bcef257a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/score_fidelity.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3e2d93776b85471e4b5ba2b4c4cd6afd1cdbb2e5944ec3a06ba1ff7d9d7c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/detect.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaee82396fde7b00bdbd15aed2e5dd94020629326051c1fdd5bcf5c7b910d93"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/retrieve_query.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1945285d209df9ee3d3672b3c5bcdea0f630c2dbb5ec93b8311b1ec9b5a99f89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(raw), \u0026obj); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/gpt_profiles.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f7877793900b1af737e36958494e24018a50b26b6b6c5fbbc1344dafefc493"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if recover() != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8dde7587f939a4e389811a3f4fc0b010aa562e06cd47900dd543cad10ae52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c9675df1027c62b5590fc4f4b012aa5c0ec088815d7666822d28c387ae95d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026cc); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffca8c85027f93f3b33d6d9b1e11c86caf35feb9d6c2fd727a68eda85ce58e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"121dc0efa0bede6dd39267ffd2c448aa0784138935d78e3cc266ba363f70dceb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"a281af799d41d2fba9a28816ed04bb43e98b02e7f746abe3ae1fd0eb303d4665"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(encoded, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_gemini.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"27528dd9ec3cedfe0dbe6ad4f19a015481b9ad86cdd10cfc9480bc45c66cfd69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if recover() != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_gemini.go"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad9e9c74a47fefd931de366183dccf0f18775a4cba4b12f2b2715da4bafd4fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/image.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f3f6682088fb209646e9b2b70f63deda8d644026838856af9b3d4850a46a6e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := png.Encode(\u0026buf, downscale(img, nw, nh)); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/image/image.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b1d079c405a4e368016c8e5ad0270c743d66a4a1d5a05c74f192f3f01a68b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30f1d3a66108dd5e20a368d8e19359e1b7708166d4027fc191afe3054171159"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_listing.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"72203af39ff8bfa7bfc52f650e1a256758310dee467ba8d6c86509cc259535c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := (\u0026printer.Config{Mode: printer.TabIndent, Tabwidth: 8}).Fprint(\u0026buf, fset, file); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/code_nocgo.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516d79d08e83f705941fbbede87842ad85241661ecd33f9ae6067a20d5ff7b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/config.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac866d5d3dbcdbed9ce2cc2b025540bc76e022801382694bd68f97c6f87ec6e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/html.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8687a8311d54047c92ea90d66cb8a56f24a42e6d48aa927ef3ad01162cd8757c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/invariants.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6509746163cb77395e5ec6c92f6e8557afd16627c8b8f4e69f4bec1f926821"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/invariants.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"6768279d20bf566f5a7b6b78219399d313a2da21c037e26ba7088707224db4b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/json.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"790cdbf8142be549bbbe57cc0877c0ef634b30a2d0328fa92baa5922842e8986"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := writer.WriteAll(shaped); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/tabular.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2031db927b1e8f7901a047f6dea3fd865cef9ffceab71079980a04d6239984ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := writer.Error(); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/tabular.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"337014628e88982de7f86c655d27e89419aa1416922ff4526d5e2bad8c89221e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toolschema.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12174e71c5e7ba5469c704e7fb024aaa74120ca98f5ff7651c2d0d28c3d1997"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_decode.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"979062bb3fd706ea244fe371325e5a5ef4de3d3f94648bc070cc50388df15045"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_decode.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0e9605211bc69686df3a52daa9cb45b20fecc3425a9cc53224c466abe96aa1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(s), \u0026out); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_decode.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"748eb9e7917f55447df8fd3dcf4b456ff89d34bc0e97420959baa11d2e90cbd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_encode.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e20dad1992324ed699ea6d27d52acb3b522e20352113018351f696750fcbf3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := dec.Decode(\u0026v); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/toon_encode.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8356d7b1aa6b16f8be263bf74fbef34d759ba4bd75cb503648fc37e713c1c57b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026model); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c24081c7b5349d872d53694d29b33a6c8d5faa1c3d5e9de8871fa43f5d088bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/ccr/store_integrity.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97800e39d9bad159ebc1632c8a3dcdfb96fa751c52f1c48e7b0c738d964f385"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc58e9bee497d1b383a054d0739b9971ffd2fabbff4b87bf8653c046e5d00da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e74fa844fd565e4435495c005636fec903d474db3ce11663441002b60c76651"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.NewDecoder(io.LimitReader(resp.Body, 64\u003C\u003C10)).Decode(\u0026version); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/cmd/caveman-browse/main.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad7ce3375f28877106fee245180d3a6d6a09440310a16bda39194a965c2cef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32ceb724f9bd46d5a81ab32b40c27bedbddff61c08de4b3c0f10ce9179bf421"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7df98ad5173bf63b451b2657cea0380a75f394df0a8d95d7eddc3c8a4a241f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"205549a4baa7b30ab1f051b4070eeb01d5a2027bf075104ddbcea1ce8de256f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f8b6b31f8aa2fa899b59845773852d57d6bf1d09f526072f5a371b15edfbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb502e8edd057e3a13dd99659f4732da679fdddd5bb2ae77fe6f5df3d5e68e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af87d19362c43ef78d1fc411d43aa82ee942cd74fb6879306260308426712ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13f976b922c8a187d68f3f2299c6f48fccf126919fe992d64c755aaa15cb106"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/caveman-delegate-mcp.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d2489a122dfebb5d92fc14efcb5ddc8e9cd38516f97a86991a8c69fd74e3c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/delegate/portable-process.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8fa19eda0070fe3361169cd3a396683b20e00fe1e5f1240a7e8e5c441fb56f"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~10.2 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 387 assertion(s) across the 37765 source line(s) of the 62 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/cli/src/index.ts (224), packages/sdk/typescript/src/index.ts (52), packages/cli/src/modules/onboard.ts (28). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/responses.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f6c830370f906a42bf63b6f5eeed5788a22ef14d772dfbc809e3a6304dde45"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/translate/translate.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a42a91906d08e5675aa3bae28628b4fcda7ad35c8edf023e4db06e3311c0c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/detect_subagent_spend.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ed713b6f7b234df061c3af1a882ffa85ea5134ddc5f6bff89b53a92ed9fd5d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn.go"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"851e2e9817562b338bd2af9a38ca880e1f62693ac436b82c0da8cced6ae5054a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd8511398e9fd8f897c11e5ec64daa34f6bd1db788bb5b798f466e02ed51db"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route.go"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae65e8af141794700ded040817bd9540ffe91fb2ca3beb9b29418b4892cc392"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"af95461857e58c272a201a0a764267c88d54b87f3f444a62616e44a3c5a1630a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1760b8d93a5a5e29b75ebb9276fc7b97ab477fddb281f1989a579c80c6283935"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/route_cache.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe09aad53573699808dcd17233a5bfdd00bfe75b6738e722724ca87deb9485"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b556a3fe8f96662cc17c6f178c89b6c59778703ff5a57bd8db303fd8ea4db5"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ef5f5244088ed237c737b1cfca83719a0dea91bac89f58d04769ca5f46664"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5398c7e12a927ed9bc7e18ff5040ba0ae395133ee712e86fc2c6658f308979"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6680a5d2bf41e1e8fc3004535f6189754770ccc2fcc4a3d72e6e5e095cf568c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"313d4cca3a9fa3cf342c0c1f702cdf61256fb17941948461b6023b1c069d8a00"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060registered\u0060 swallows every exception into \u0060return False\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/_native.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"592edff39d818568454a759b6a5cb7a73cd38de2abad3c1a193b7c2feb03fde5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_messages_call\u0060 swallows every exception into \u0060return False\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/anthropic.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97b60f56918475fed2a36d04056a81ab5eadd47c56c78b6967e5ce55da2fd16"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_recovery_intact\u0060 returns \u0060False\u0060 when \u0060(TypeError, ValueError, AttributeError, RecursionError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/langchain.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"846883fe2cc2dd7a668e4b79069193a6ce5a74b93ab0e51a51df958501a94c42"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_still_registered\u0060 swallows every exception into \u0060return False\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd371c9565ee1511c3ed4f8b8077cbebafbfd526edf6cec5548714a3e9e2829e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_reader_current\u0060 swallows every exception into \u0060return False\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/middleware/python/caveman_middleware/llama_index.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d18886839b80e1ce223cefa99b75124e5dd8321e28f09e86b63aaa65b27a3d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060claude_version\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/llm_run.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ae86457e1bc2079158cb6cc9f8ed2fb968b29105cf0569e6b23775dbb900c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060modelFromJSON\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cmd/caveman-engine/main.go"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0934cbcd5bde78ae1fadbff35571af5d6da5055bd602aa332458627353ecb32"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060compactAXString\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/compressors/axtree.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac57f7d6ebb70aadd10749169c1c2d9ea84fa2ea4bdf83c6b882e169f7a4dd8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060jsonCompact\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022null\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"da96e2894750bf3857663ed29c17c4b6f2b448ef11440a1f5489e1d35255ad2d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060safeStringifyLen\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/pixel/transform_anthropic.go"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2032a74027afb5a53bae189b0a42f1d369405a5d8b0f6da010eeba211aa5148b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060macKeychain\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90978827126b426201b11785e9bcb28be2da873b433bf260816e3ad53d49538"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060poolAnswer\u0060 turns a non-nil \u0060err\u0060 into \u0060return nil, \u0022\u0022, \u0022login_unusable\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/cloudlink/link.go"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c651cdf8f3d047a28020ad4342749439d2e21b73a624397820f1706cbf884e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060warmBody\u0060 turns a non-nil \u0060err\u0060 into \u0060return nil, 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/gateway/cache_warm.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"20190bebf313a7af411cb3aba48c0496956bb0407a678e955a9cc24715460380"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060currentRepositoryState\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6c087036bf8c8a9efdfe72950bcfd9d76b518a940512636f8206c55d25c45e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060findGitDir\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a20a9216142bff69ba644d2f78f4bd89bb1eccdad3a7d4e1b86e3fc7aecbb5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060configuredMode\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022compress\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5f7ff182713bc49e3ab557c3ad8b8a2c2a150ed5d0a833af41a81a54fce77"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060fileInputState\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/nativehook/hook.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f198141da6c621b342b9a655aa12b2cd40eec8015315702ba53c71dad1bcf65b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060gitActivity\u0060 turns a non-nil \u0060err\u0060 into \u0060return map[string]int{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/repointel/index.go"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"613dd6b64c155791dfdca9a21f520ade3a994a88540a8dfdd45e893681e94765"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060claudeRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b74be74acaad88d6ded7f9a4b54419bc5ac5e2fcf617fe88d6b5703af52a03f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060codexRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307d257d5b3d5e86dd383aadd90633f276bb930bad43e9f4d44107a00fb908b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060geminiRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0104dc96c36352abcd4eafb8ba3bcaf20508b6094477f52f71f560cea01941a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060opencodeRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8676f1085832a45d2463bf8862a7beaae5abe02b950fadba05c32e27d574ffe3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060piRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"533c8953149249a9ad91c23ef0d4cb6f0cc7d1de4060267186553145b35aa735"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060claudeGlobalConfigPath\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06287bd25fb3a76b5b9ada5879d08f32603eb7f5f73ce0266a492ae3903228c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readSkillFrontmatter\u0060 turns a non-nil \u0060err\u0060 into \u0060return skillFrontmatter{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e1864c6c837f07618b7335d14cd60348a05ecff83446a7c088013879dac30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060scanHooks\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afb5c99347226453661863355b8f48bca913b636e3f9037fe0dd04a4460870e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060countPlugins\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/config_scan.go"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3aa9035fee5eddc589c5f6e389854e882e3e00e5dbf01b146edb26dcde39b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060toolInputSummary\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_loops.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f27a6d5b79363ee48ae3cfc472006b44d3c3164ff4f0e1f4c0df05089694e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060learnTrendsHTML\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn_trends.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b39f96786a4078aa4c3ef131a9b1f4a41f5413093a4a558e34d7eae1759793"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060int64FromAny\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f15b24d446ba479cd572d417869c8f240eca090b024613db72ffec6f5e7f13c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060float64FromAny\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/usage_import.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8b41b907674a95bbd3303e8cff4d22e53964637081dd3ba80b5383478255a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decodeAccountingBody\u0060 turns a non-nil \u0060err\u0060 into \u0060return nil, \u0022content_decode_failed/gzip\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/providers/adapter.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"307164d14ae53fe71a3ab56f206aeefd44202e4b2c0ecc25660808e816df52cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060stsErrorCode\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/platform/awscreds/awscreds.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f323d292662270e50d579bd7c8333ffbdc00caabac1e8cf54d2f757b36036"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060executable\u0060 (in \u0060which\u0060) swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/probe-installed.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e1ce3fcb554b3ef2aacdd720b70f4bb1c5aeabca41a4baeafc924f59eaa539"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060executable\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/bin/binary-installer.generated.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dd551d3d1f517178fe8a24f6d95da06def0f79cc21783bbf1cc218699a7757"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060signedDigest\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/bin/binary-installer.generated.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a405fe9efe5a63fb6a6d0c3301192dfc377825ee95f5d99d39941069e9b6c446"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060withoutOwnNpmBin\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/bin/caveman-browse.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b514964fbb5e7c5d50be989d4c0affca521137cbdf4e3afb622cff92f5b65d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ffVersion\u0060 swallows every exception into \u0060return \u0022unknown\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/scripts/firefox-e2e.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa34d243ef9dbb04f7be2cc41f470fbcdf274242991a6f70bec0e25d0284b71"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060takeCreatedDirs\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/lib/openclaw.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2551a3691f11450ee5221f869cdf7baa5fc0f94fa31434416597b5c764ceec83"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cursorExtPresent\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf87d499c57d808ee46b77fbead5bc0b9c1bcbc230b8012736bd67950c793e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeStat\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"53483b250467afd1ee35cdbff922b62af693324ec6ddc2db2a433db5a4795c73"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060claudeCavemanEnabled\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c582e6945e8800805955da9732087d67169b22cc974e6924d668d5afbf9c1fbb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060geminiCavemanTurnedOff\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f371e92fa93221115684098ad949e5680449d8c202c79158ba34d028c00a57"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060remainingNativeIntegrations\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"installer/install.js"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8aecf2a005c2196d4b596e8c2bcf341f7a641d49ea77bfe8ea115dbffe2782"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060executable\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/bin/binary-installer.generated.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae6279e6c166ba19281676d3a3f314d34437ca4865a7e43d3eabd9e9ad16006"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060signedDigest\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/bin/binary-installer.generated.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bf3f267c6309bc51b0e64b36bb45a617dc5b77c5a774955b180b5358b6765d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060withoutOwnNpmBin\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/bin/caveman-mcp.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c162a1022c9cab920194c1cec4ca476b740f07725b3800f3e7a476a8b0e645"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060storedConfig\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/modules/onboard.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c096ee6232f893ec90a8232d9605b4a87afead6b42cfe59d235f1b40bbfca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gatewayUrlFromConfigFile\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c720ced66875c0520fc4121c8ecdc37a279c96e04e6ed5df3eb022cd414828"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060journaledRouteOrigins\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"426ac11805b30e2047eb25fead9f8afd4fa5e9eecc9a9469aaf4f11dff958f91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060discoverTargetsInRoot\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c414719d8255d8f44a6bccd64ef0ae14949087934c448a2e93ad8d07fb539b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060globalCapabilityDocument\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a579d38c070fd1e2d7393e1c2df01a46a8e27939b96c995cddf8debafe6c25e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060projectCapabilityDocument\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":4662}}}],"partialFingerprints":{"codehealthFindingId/v1":"657f33d0b28e0f5b63d6e23a196fe30c9faba698a6055c048b4ae6aeea7d8ae5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readJsonObject\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":7868}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6fb44805a9f8ed70771b0e5bf535c7de3810677c9c43f4a6ac5ba0817feb2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060text\u0060 (in \u0060agentOwnEndpoint\u0060) swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":8887}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0a5626b05ae4d68d3c55b925d560039ba71dc2e564a7ff2f955711df4ada30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060claudeProfileRoots\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22953bd4d4bc404eb9947432284aeb694b847fb7f985113b65711027ec83d39"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060claudeUnwiredProfiles\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":11335}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bda4ccdfbeeaf2c6ca54e5445703489bb7f4f9f4c5464c50eac703c55ff79d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gatewayNoProxyEnv\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c999468825b1b600e08a66f01fb2e4c92a0501d6726e8dee2fad70bd10cfb12"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 (in \u0060wrapWorkTags\u0060) swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec72c6da1c6f90e2e54a4fab152a7fa276e952d841f79c5cd54bf72a78275934"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060orgIdFromConfigFile\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":12682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49de3e92b10cc02754598adf085a86b80f2739e5817c042f0dc327e905ababe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSyncWatermark\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":13338}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c3c557d2252debefdeadea3b1e90448b1dac2bbda8f0a7f12e8f406fda6cc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readNativeReceipts\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":17934}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3894568c8fa654461f8b42d583906a094639adece1393d9d0aa8a754c6b057a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060installedDirectiveIds\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":19378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aedc87f952f58ce47df6e17d05e936b6b8d47294b9ea713b5d3dc55d4829b4f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060learnReportMtime\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20013}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeb622bcaff0199beaf45c26d620b61326eda02a8606cd210920b95a70b180a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060learnReportGeneration\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":20025}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0692f629e2f0607f345ec5e8fca2a1540ba621cb9274ef2c5c12c296176b8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060usageSecretGet\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4569abea6ac785738626d2c4dec697468c4c6b2a42833871a4489e504f95a6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cliVersion\u0060 swallows every exception into \u0060return \u00220.0.0\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":21895}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efa4d60b4a8c30379d8de6cbde859457ec1d0bde3154c77abd34c16292fd2ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060formatCurrencyAmount\u0060 swallows every exception into \u0060return \u0022\u2014\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":22544}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd80ea8ee4f2745287a8d4bdce41da8b8f08bde7de1a08ebf486f08fb32e58b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060genericKeychainGet\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad018342dddd7043b025d60e396e14f3004c4a7ae76f11102aab595c61845119"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fileTokenGet\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/index.ts"},"region":{"startLine":23099}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bb29058fe68660bb3a79c538986ed2e0f5f9c8f1f49010f66786f3460cce3f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060partials\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/tests/setup-install.runtime.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dbf76071c4dbe58191f3712f03783e9fd4c6bbb62d7f8d59a5958fc48c145b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060executable\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d021b80c145a3e99558ccdbc726b9722170c6d3c4036f98471ee150bf997c76d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060signedDigest\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/binary-installer/installer.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19dfff14488d1d0f0a020ab1d4bdfb0edb9c51791272813a96852d7519d5b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060executable\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shrink/bin/binary-installer.generated.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52f09b2b8ed8fef152300506a77bb16e26f260215781c35a27c5f1b0fe85ab1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060signedDigest\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shrink/bin/binary-installer.generated.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee34e56e3bda3c69ef58500ad6bff35cbfa50550089b9dbb3f31616cdd6daf7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gcSessionStore\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f1eb3d8a47ccf59ee6465623b2f587525c4c7f40a64fff69a7211a5e1b9028"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readHistory\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/caveman-config.js"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3afd846f3b53908f82290427322527b00e9fada0a3604cf7d8acd970ced2bd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(m, \u0022[1m]\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(m, \u0022[1m]\u0022)\u0060 also satisfies \u0060strings.Contains(m, \u00221m\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proxy/internal/store/learn.go"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb5dcb3fd2858177ac43a72b8e0f8a93e721230bcc4bf3612a274c0e42c4df0"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.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-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"Improper Certificate Validation","shortDescription":{"text":"Improper Certificate Validation"},"helpUri":"https://cwe.mitre.org/data/definitions/295.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-354","guid":"7cd63dcb-3079-9656-8552-67f89892625e","name":"CWE-354","shortDescription":{"text":"CWE-354"},"helpUri":"https://cwe.mitre.org/data/definitions/354.html"},{"id":"CWE-390","guid":"7484c168-de95-2c52-afd2-197fb3efb184","name":"Detection of Error Condition Without Action","shortDescription":{"text":"Detection of Error Condition Without Action"},"helpUri":"https://cwe.mitre.org/data/definitions/390.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-665","guid":"fe279ff9-a979-f952-9df9-3f7d05af85d8","name":"CWE-665","shortDescription":{"text":"CWE-665"},"helpUri":"https://cwe.mitre.org/data/definitions/665.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-908","guid":"ca1da1d1-5eaf-e95b-adbb-4eb2bc10b9fc","name":"CWE-908","shortDescription":{"text":"CWE-908"},"helpUri":"https://cwe.mitre.org/data/definitions/908.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"}]}],"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":68,"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."]}]}